Welfare maximization for bus transit systems with timed transfers and financial constraints

Conventional and flexible bus services may be combined to better serve regions with a wide range of characteristics. If demand densities and resulting service frequencies are low, the coordination of bus arrivals at transfer stations may significantly reduce passenger transfer times. A method is proposed for integrating, coordinating, and optimizing bus services while considering many‐to‐many travel patterns, demand elasticity, financial constraints, and appropriate service type for various regions. The objective is to maximize welfare, that is, the sum of producer and consumer surplus. The problem is solved with a hybrid optimization method, in which a genetic algorithm with bounded integer variables is selected for solving one of the subproblems. The service types, fares, headways, and service zone sizes are jointly optimized. Sensitivity analyses explore how the choice among conventional and flexible busses depends on the demand, subsidy, and demand elasticity parameters. The results also show that welfare can increase due to coordination, and these increases are found to be higher in cases with high demand or low subsidy. Copyright © 2015 John Wiley & Sons, Ltd.     

Multiclass fuzzy user equilibrium with endogenous membership functions and risk‐taking behaviors

Over the last decades, several approaches have been proposed in the literature to incorporate users' perceptions of travel costs, their bounded rationality, and risk‐taking behaviors into network equilibrium modeling for traffic assignment problem. While theoretically advanced, these models often suffer from high complexity and computational cost and often involve parameters that are difficult to estimate. This study proposes an alternative approach where users' imprecise perceptions of travel times are endogenously constructed as fuzzy sets based on the probability distributions of random link travel times. Two decision rules are proposed accordingly to account for users' heterogeneous risk‐taking behaviors, that is, optimistic and pessimistic rules. The proposed approach, namely, the multiclass fuzzy user equilibrium, can be formulated as a link‐based variational inequality model. The model can be solved efficiently, and parameters involved can be either easily estimated or treated as factors for calibration against observed traffic flow data. Numerical examples show that the proposed model can be solved efficiently even for a large‐scale network of Mashhad, Iran, with 2538 links and 7157 origin–destination pairs. The example also illustrates the calibration capability of the proposed model, highlighting that the model is able to produce much more accurate flow estimates compared with the Wardropian user equilibrium model. Copyright © 2016 John Wiley & Sons, Ltd.     

Surrogate‐based optimization of cordon toll levels in congested traffic networks

The benefit, in terms of social surplus, from introducing congestion charging schemes in urban networks is depending on the design of the charging scheme. The literature on optimal design of congestion pricing schemes is to a large extent based on static traffic assignment, which is known for its deficiency in correctly predict travel times in networks with severe congestion. Dynamic traffic assignment can better predict travel times in a road network, but are more computational expensive. Thus, previously developed methods for the static case cannot be applied straightforward. Surrogate‐based optimization is commonly used for optimization problems with expensive‐to‐evaluate objective functions. In this paper, we evaluate the performance of a surrogate‐based optimization method, when the number of pricing schemes, which we can afford to evaluate (because of the computational time), are limited to between 20 and 40. A static traffic assignment model of Stockholm is used for evaluating a large number of different configurations of the surrogate‐based optimization method. Final evaluation is performed with the dynamic traffic assignment tool VisumDUE, coupled with the demand model Regent, for a Stockholm network including 1240 demand zones and 17 000 links. Our results show that the surrogate‐based optimization method can indeed be used for designing a congestion charging scheme, which return a high social surplus. Copyright © 2016 John Wiley & Sons, Ltd.     

Assessing carbon reduction effects toward the mode shift of green transportation system

Plans are underway to introduce green transportation systems at Taiwan's famous scenic spot, Sun Moon Lake, to reduce carbon emissions. Carbon reduction effects after changing the current lake tour modes are assessed using a nested logit model with a stated preference survey, which investigated tourists' choice preferences. The empirical results reveal that the modes of electric bus, electric vehicle sharing, and bike are clustered in the same competitive group. Travel cost, in‐vehicle travel time, and out‐vehicle travel time are found to be statistically significant with the expected negative effects. In particular, the attribute of carbon reduction is only significant for green tourists, who are willing to pay US$ 3.5/kg of carbon saved. The result indicates that more efficient carbon reduction is possible by restricting the usage of gasoline vehicles rather than improving the service levels of low‐carbon modes. Notably, the effect of parking charges on emission reduction is equal to the amount of carbon dioxide absorbed by 4511 trees per day. Copyright © 2016 John Wiley & Sons, Ltd.     

A weight-based map-matching algorithm for vehicle navigation in complex urban networks

A map-matching algorithm is an integral part of every navigation system and reconciles raw and inaccurate positional data (usually from a global positioning system [GPS]) with digital road network data. Since both performance (speed) and accuracy are equally important in real-time map-matching, an accurate and efficient map-matching algorithm is presented in this article. The proposed algorithm has three steps: initialization, same-segment, and next-segment. Distance between the GPS point and road segments, difference between the heading of the GPS point and direction of road segments, and difference between the direction of consecutive GPS points and direction of road segments are used to identify the best segment among candidates near intersections. In contrast to constant weights applied in existing algorithms, the weight of each criterion in this algorithm is dynamic. The weights of criteria are calculated for each GPS point based on its: (a) positional accuracy, (b) speed, and (c) traveled distance from previous GPS point. The algorithm considers a confidence level on the assigned segment to each GPS point, which is calculated based on the density and complexity of roads around the GPS point. The evaluation results indicate 95.34% correct segment identification and 92.19% correct segment assignment. The most important feature of our algorithm is that the high correct segment identification percentage achieved in urban areas is through a simple and efficient weight-based method that does not depend on any additional data or positioning sensors other than digital road network and GPS.     

Experimental Investigation of a Hydraulic Turbine for Hydrokinetic Power Generation in Irrigation/Rainfall Channels

The development of microchannels with open flow for use in irrigation and rainy areas is challenged by electricity generation via hydrokinetic devices in shallo...