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.     

An equilibrium analysis of commuter parking in the era of autonomous vehicles

This study is the first in the literature to model the joint equilibrium of departure time and parking location choices when commuters travel with autonomous vehicles (AVs). With AVs, walking from parking spaces to the work location is not needed. Instead, AVs will drop off the commuters at the workplace and then drive themselves to the parking spaces. In this context, the equilibrium departure/arrival profile is different from the literature with non-autonomous vehicles (non-AVs). Besides modeling the commuting equilibrium, this study further develops the first-best time-dependent congestion tolling scheme to achieve the system optimum. Also, a location-dependent parking pricing scheme is developed to replace the tolling scheme. Furthermore, this study discusses the optimal parking supply to minimize the total system cost (including both the travel cost and the social cost of parking supply) under either user equilibrium or system optimum traffic flow pattern. It is found that the optimal planning of parking can be different from the non-AV situation, since the vehicles can drive themselves to parking spaces that are further away from the city center and walking of commuters is avoided. This paper sheds light on future parking supply planning and traffic management.     

Distributed coordinated in-vehicle online routing using mixed-strategy congestion game

This study proposes a coordinated online in-vehicle routing mechanism for smart vehicles with real-time information exchange and portable computation capabilities. The proposed coordinated routing mechanism incorporates a discrete choice model to account for drivers’ behavior, and is implemented by a simultaneously-updating distributed algorithm. This study shows the existence of an equilibrium coordinated routing decision for the mixed-strategy routing game and the convergence of the distributed algorithm to the equilibrium routing decision, assuming individual smart vehicles are selfish players seeking to minimize their own travel time. Numerical experiments conducted based on Sioux Falls city network indicate that the proposed distributed algorithm converges quickly under different smart vehicle penetrations, thus it possesses a great potential for online applications. Moreover, the proposed coordinated routing mechanism outperforms traditional independent selfish-routing mechanism; it reduces travel time for both overall system and individual vehicles, which represents the core idea of Intelligent Transportation Systems (ITS).     

Dynamic user equilibrium with side constraints for a traffic network: Theoretical development and numerical solution algorithm

This paper investigates a traffic volume control scheme for a dynamic traffic network model which aims to ensure that traffic volumes on specified links do not exceed preferred levels. The problem is formulated as a dynamic user equilibrium problem with side constraints (DUE-SC) in which the side constraints represent the restrictions on the traffic volumes. Travelers choose their departure times and routes to minimize their generalized travel costs, which include early/late arrival penalties. An infinite-dimensional variational inequality (VI) is formulated to model the DUE-SC. Based on this VI formulation, we establish an existence result for the DUE-SC by showing that the VI admits at least one solution. To analyze the necessary condition for the DUE-SC, we restate the VI as an equivalent optimal control problem. The Lagrange multipliers associated with the side constraints as derived from the optimality condition of the DUE-SC provide the traffic volume control scheme. The control scheme can be interpreted as additional travel delays (either tolls or access delays) imposed upon drivers for using the controlled links. This additional delay term derived from the Lagrange multiplier is compared with its counterpart in a static user equilibrium assignment model. If the side constraint is chosen as the storage capacity of a link, the additional delay can be viewed as the effort needed to prevent the link from spillback. Under this circumstance, it is found that the flow is incompressible when the link traffic volume is equal to its storage capacity. An algorithm based on Euler’s discretization scheme and nonlinear programming is proposed to solve the DUE-SC. Numerical examples are presented to illustrate the mechanism of the proposed traffic volume control scheme.     

Road pricing for congestion control with unknown demand and cost functions

It is widely recognized that precise estimation of road tolls for various pricing schemes requires a few pieces of information such as origin–destination demand functions, link travel time functions and users’ valuations of travel time savings, which are, however, not all readily available in practice. To circumvent this difficulty, we develop a convergent trial-and-error implementation method for a particular pricing scheme for effective congestion control when both the link travel time functions and demand functions are unknown. The congestion control problem of interest is also known as the traffic restraint and road pricing problem, which aims at finding a set of effective link toll patterns to reduce link flows to below a desirable target level. For the generalized traffic equilibrium problem formulated as variational inequalities, we propose an iterative two-stage approach with a self-adaptive step size to update the link toll pattern based on the observed link flows and given flow restraint levels. Link travel time and demand functions and users’ value of time are not needed. The convergence of the iterative toll adjustment algorithm is established theoretically and demonstrated on a set of numerical examples.     

Existence of self-financing and Pareto-improving congestion pricing: Impact of value of time distribution

This paper considers a static congestion pricing model in which travelers select a mode from either, driving on highway or taking public transit, to minimize a combination of travel time, operating cost and toll. The focus is to examine how travelers’ value of time (VOT), which is continuously distributed in a population, affects the existence of a pricing-refunding scheme that is both self-financing (i.e. requiring no external subsidy) and Pareto-improving (i.e. reducing system travel time while making nobody worse off). A condition that insures the existence of a self-financing and Pareto-improving (SFPI) toll scheme is derived. Our derivation reveals that the toll authority can select a proper SFPI scheme to distribute the benefits from congestion pricing through a credit-based pricing scheme. Under mild assumptions, we prove that an SFPI toll always exists for concave VOT functions, of which the linear function corresponding to the uniform distribution is a special case. Existence conditions are also established for a class of rational functions. These results can be used to analyze more realistic VOT distributions such as log-normal distribution. A useful implication of our analysis is that the existence of an SFPI scheme is not guaranteed for general functional forms. Thus, external subsidies may be required to ensure Pareto-improving, even if policy-makers are willing to return all toll revenues to road users.     

Joint optimization of freight facility location and pavement infrastructure rehabilitation under network traffic equilibrium

Establishment of industry facilities often induces heavy vehicle traffic that exacerbates congestion and pavement deterioration in the neighboring highway network. While planning facility locations and land use developments, it is important to take into account the routing of freight vehicles, the impact on public traffic, as well as the planning of pavement rehabilitation. This paper presents an integrated facility location model that simultaneously considers traffic routing under congestion and pavement rehabilitation under deterioration. The objective is to minimize the total cost due to facility investment, transportation cost including traffic delay, and pavement life-cycle costs. Building upon analytical results on optimal pavement rehabilitation, the problem is formulated into a bi-level mixed-integer non-linear program (MINLP), with facility location, freight shipment routing and pavement rehabilitation decisions in the upper level and traffic equilibrium in the lower level. This problem is then reformulated into an equivalent single-level MINLP based on Karush–Kuhn–Tucker (KKT) conditions and approximation by piece-wise linear functions. Numerical experiments on hypothetical and empirical network examples are conducted to show performance of the proposed algorithm and to draw managerial insights.     

Toll pricing framework under logit‐based stochastic user equilibrium constraints

This paper addresses the toll pricing framework for the first‐best pricing with logit‐based stochastic user equilibrium (SUE) constraints. The first‐best pricing is usually known as marginal‐cost toll, which can be obtained by solving a traffic assignment problem based on the marginal cost functions. The marginal‐cost toll, however, has rarely been implemented in practice, because it requires every specific link on the network to be charged. Thus, it is necessary to search for a substitute of the marginal cost pricing scheme, which can reduce the toll locations but still minimize the total travel time. The toll pricing framework is the set of all the substitute toll patterns of the marginal cost pricing. Assuming the users' route choice behavior following the logit‐based SUE principle, this paper has first derived a mathematical expression for the toll pricing framework. Then, by proposing an origin‐based variational inequality model for the logit‐based SUE problem, another toll pricing framework is built, which avoids path enumeration/storage. Finally, the numerical test shows that many alternative pricing patterns can inherently reduce the charging locations and total toll collected, while achieving the same equilibrium link flow pattern. Copyright © 2013 John Wiley & Sons, Ltd.     

Routing aspects of electric vehicle drivers and their effects on network performance

This study investigates the routing aspects of battery electric vehicle (BEV) drivers and their effects on the overall traffic network performance. BEVs have unique characteristics such as range limitation, long battery recharging time, and recuperation of energy lost during the deceleration phase if equipped with regenerative braking system (RBS). In addition, the energy consumption rate per unit distance traveled is lower at moderate speed than at higher speed. This raises two interesting questions: (i) whether these characteristics of BEVs will lead to different route selection compared to conventional internal combustion engine vehicles (ICEVs), and (ii) whether such route selection implications of BEVs will affect the network performance. With the increasing market penetration of BEVs, these questions are becoming more important. This study formulates a multi-class dynamic user equilibrium (MCDUE) model to determine the equilibrium flows for mixed traffic consisting of BEVs and ICEVs. A simulation-based solution procedure is proposed for the MCDUE model. In the MCDUE model, BEVs select routes to minimize the generalized cost which includes route travel time, energy related costs and range anxiety cost, and ICEVs to minimize route travel time. Results from numerical experiments illustrate that BEV drivers select routes with lower speed to conserve and recuperate battery energy while ICEV drivers select shortest travel time routes. They also illustrate that the differences in route choice behavior of BEV and ICEV drivers can synergistically lead to reduction in total travel time and the network performance towards system optimum under certain conditions.     

Evaluating the benefits of a combined route guidance and road pricing system in a traffic network with recurrent congestion

When drivers do not have complete information on road travel time and thus choose their routes in a stochastic manner or based on their previous experience, separate implementations of either route guidance or road pricing cannot drive a stochastic network flow pattern towards a system optimum in a Wardropian sense. It is thus of interest to consider a combined route guidance and road pricing system. A road guidance system could reduce drivers' uncertainty of travel time through provision of traffic information. A driver who is equipped with a guidance system could be assumed to receive complete information, and hence be able to find the minimum travel time routes in a user-optimal manner, while marginal-cost road pricing could drive a user-optimal flow pattern toward a system optimum. Therefore, a joint implementation of route guidance and road pricing in a network with recurrent congestion could drive a stochastic network flow pattern towards a system optimum, and thus achieve a higher reduction in system travel time. In this paper the interaction between route guidance and road pricing is modeled and the potential benefit of their joint implementation is evaluated based on a mixed equilibrium traffic assignment model. The private and system benefits under marginal-cost pricing and varied levels of market penetration of the information systems are investigated with a small and a large example. It is concluded that the two technologies complement each other and that their joint implementation can reduce travel time more efficiently in a network with recurrent congestion.     

Evaluation of a reactive dynamic route guidance strategy

The aim of the paper is to evaluate the performance of a new strategy which is able to control dynamic route guidance (DRG) systems, mainly in urban road networks. The purpose of this strategy is to achieve dynamic user equilibrium in the network, even in abnormal network conditions, for example when there is an unexpected increase in traffic volume. It is based on feedback concept and it reacts to the traffic conditions observed in real time by adopting a decentralized structure.A series of experiments was performed, by means of a traffic micro-simulator, in a section of an urban road network. In the situations examined, the results seem to be quite positive. The analyses of the link level show that all of the various travel alternatives to reach the destination become more advantageous for users if DRG devices become more widespread among vehicles. In some cases we observe that the strategy succeeds in maintaining the possible alternatives in equilibrium conditions, by distributing users among the feasible turns. At no point in our investigations do we observe an unstable behaviour of the system, even when the number of vehicles fitted with a DRG device increases.     

Road pricing modeling for hyper-congestion

Recently there has been a resurgence in the interest of road pricing. Most studies adopt the static modeling paradigm, typically using either separable monotone or backward-bending link travel time functions for the analysis. In this study, through the shockwave analysis, we show that separable backward-bending functions are not appropriate for modeling hyper-congestion and hence road pricing. In the absence of queue spillback, link travel time is a monotone increasing function of inflow. However, in the presence of queue spillback, we show that the static paradigm even with a monotone travel time function cannot adequately portray the congestion phenomenon. In some cases, the tolls determined by the static paradigm can be even detrimental, worsening rather than alleviating the congestion problem. In the end, to model congested networks properly, perhaps one has no other choices but to adopt a modeling paradigm that faithfully captures both the temporal as well as the spatial dimensions of traffic queuing.     

Minimizing CO2e emissions by setting a road toll

The main purpose of this paper is to develop a bi-level pricing model to minimize the CO₂e emissions and the total travel time in a small road network. In the lower level of the model, it is assumed that users of the road network find a dynamic user equilibrium which minimizes the total costs of those in the system. For the higher level of the model, different road toll strategies are applied in order to minimize the CO₂e emissions. The model has been applied to an illustrative example. It shows the effects on traffic flows, revenues, total time and CO₂e emissions for different numbers of servers collecting tolls and different pricing strategies over a morning peak traffic period. The results show that the CO₂e emissions produced can be significantly affected by the number of servers and the type of toll strategy employed. The model is also used to find the best toll strategy when there is a constraint on the revenue that is required to be raised from the toll and how this affects the emissions produced. Further runs compare strategies to minimize the CO₂e emissions with those that minimize total travel time in the road system. In the illustrative example, the results for minimizing CO₂e emissions are shown to be similar to the results obtained from minimizing the total travel time.     

The corridor problem: Preliminary results on the no-toll equilibrium

Consider a traffic corridor that connects a continuum of residential locations to a point central business district, and that is subject to flow congestion. The population density function along the corridor is exogenous, and except for location vehicles are identical. All vehicles travel along the corridor from home to work in the morning rush hour, and have the same work start-time but may arrive early. The two components of costs are travel time costs and schedule delay (time early) costs. Determining equilibrium and optimum traffic flow patterns for this continuous model, and possible extensions, is termed “The Corridor Problem”. Equilibria must satisfy the trip-timing condition, that at each location no vehicle can experience a lower trip price by departing at a different time. This paper investigates the no-toll equilibrium of the basic Corridor Problem.     

A systematic review of route optimisation and pre-emption methods for emergency vehicles

ABSTRACT

Reducing the travel time of emergency vehicles (EVs) is an effective way to improve critical services such as ambulance, fire, and police. Route optimisation and pre-emption are powerful techniques used to reduce EV travel time. This paper presents a systematic literature review of optimisation and pre-emption techniques for routing EVs. A detailed classification of existing techniques is presented along with critical analysis and discussion. The study observes the limitations of existing routing systems and lack of real-world applications of the proposed pre-emption systems, leading to several interesting and important knowledge and implementation gaps that require further investigation. These gaps include optimisations using real-time dynamic traffic data, considering time to travel as a critical parameter within dynamic route planning algorithms, considering advanced algorithms, assessing and minimising the effects of EV routing on other traffic, and addressing safety concerns in traffic networks containing multiple EVs at the same time.     

Exploring the effects of cooperative adaptive cruise control on highway traffic flow using microscopic traffic simulation

This paper examines the impact of having cooperative adaptive cruise control (CACC) embedded vehicles on traffic flow characteristics of a multilane highway system. The study identifies how CACC vehicles affect the dynamics of traffic flow on a complex network and reduce traffic congestion resulting from the acceleration/deceleration of the operating vehicles. An agent-based microscopic traffic simulation model (Flexible Agent-based Simulator of Traffic) is designed specifically to examine the impact of these intelligent vehicles on traffic flow. The flow rate of cars, the travel time spent, and other metrics indicating the evolution of traffic congestion throughout the lifecycle of the model are analyzed. Different CACC penetration levels are studied. The results indicate a better traffic flow performance and higher capacity in the case of CACC penetration compared to the scenario without CACC-embedded vehicles.     

Network impacts of a road capacity reduction: Empirical analysis and model predictions

In spite of their widespread use in policy design and evaluation, relatively little evidence has been reported on how well traffic equilibrium models predict real network impacts. Here we present what we believe to be the first paper that together analyses the explicit impacts on observed route choice of an actual network intervention and compares this with the before-and-after predictions of a network equilibrium model. The analysis is based on the findings of an empirical study of the travel time and route choice impacts of a road capacity reduction. Time-stamped, partial licence plates were recorded across a series of locations, over a period of days both with and without the capacity reduction, and the data were ‘matched’ between locations using special-purpose statistical methods. Hypothesis tests were used to identify statistically significant changes in travel times and route choice, between the periods of days with and without the capacity reduction. A traffic network equilibrium model was then independently applied to the same scenarios, and its predictions compared with the empirical findings. From a comparison of route choice patterns, a particularly influential spatial effect was revealed of the parameter specifying the relative values of distance and travel time assumed in the generalised cost equations. When this parameter was ‘fitted’ to the data without the capacity reduction, the network model broadly predicted the route choice impacts of the capacity reduction, but with other values it was seen to perform poorly. The paper concludes by discussing the wider practical and research implications of the study’s findings.     

Estimating link travel time functions for heterogeneous traffic flows on freeways

Oversized vehicles, such as trucks, significantly contribute to traffic delays on freeways. Heterogeneous traffic populations, that is, those consisting of multiple vehicles types, can exhibit more complicated travel behaviors in the operating speed and performance, depending on the traffic volume as well as the proportions of vehicle types. In order to estimate the component travel time functions for heterogeneous traffic flows on a freeway, this study develops a microscopic traffic‐simulation based four‐step method. A piecewise continuous function is proposed for each vehicle type and its parameters are estimated using the traffic data generated by a microscopic traffic simulation model. The illustrated experiments based on VISSIM model indicate that (i) in addition to traffic volume, traffic composition has significant influence on the travel time of vehicles and (ii) the respective estimations for travel time of heterogeneous flows could greatly improve their estimation accuracy. Copyright © 2016 John Wiley & Sons, Ltd.     

A network wide simulation strategy of alternative fuel vehicles

This paper presents an integrated simulator “CUIntegration” to evaluate routing strategies based on energy and/or traffic measures of effectiveness for any Alternative Fuel Vehicles (AFVs). The CUIntegration can integrate vehicle models of conventional vehicles as well as AFVs developed with MATLAB-Simulink, and a roadway network model developed with traffic microscopic simulation software VISSIM. The architecture of this simulator is discussed in this paper along with a case study in which the simulator was utilized for evaluating a routing strategy for Plug-in Hybrid Electric Vehicles (PHEVs) and Electric Vehicles (EVs). The authors developed a route optimization algorithm to guide an AFV based on that AFV driver’s choice, which included; finding a route with minimum (1) travel time, (2) energy consumption or (3) a combination of both. The Application Programming Interface (API) was developed using Visual Basic to simulate the vehicle models/algorithms developed in MATLAB and direct vehicles in a roadway network model developed in VISSIM accordingly. The case study included a section of Interstate 83 in Baltimore, Maryland, which was modeled, calibrated and validated. The authors considered a worst-case scenario with an incident on the main route blocking all lanes for 30 min. The PHEVs and EVs were represented by integrating the MATLAB-Simulink vehicle models with the traffic simulator. The CUIntegration successfully combined vehicle models with a roadway traffic network model to support a routing strategy for PHEVs and EVs. Simulation experiments with CUIntegration revealed that routing of PHEVs resulted in cost savings of about 29% when optimized for the energy consumption, and for the same optimization objective, routing of EVs resulted in about 64% savings.     

Network user equilibrium of battery electric vehicles considering flow-dependent electricity consumption

This paper addresses the equilibrium traffic assignment problem involving battery electric vehicles (BEVs) with flow-dependent electricity consumption. Due to the limited driving range and the costly/time-consuming recharging process required by current BEVs, as well as the scarce availability of battery charging/swapping stations, BEV drivers usually experience fear that their batteries may run out of power en route. Therefore, when choosing routes, BEV drivers not only try to minimize their travel costs, but also have to consider the feasibility of their routes. Moreover, considering the potential impact of traffic congestion on the electricity consumption of BEVs, the feasibility of routes may be determined endogenously rather than exogenously. A set of user equilibrium (UE) conditions from the literature is first presented to describe the route choice behaviors of BEV drivers considering flow-dependent electricity consumption. The UE conditions are then formulated as a nonlinear complementarity model. The model is further formulated as a variational inequality (VI) model and is solved using an iterative solution procedure. Numerical examples are provided to demonstrate the proposed models and solution algorithms. Discussions of how to evaluate and improve the system performance with non-unique link flow distribution are offered. A robust congestion pricing model is formulated to obtain a pricing scheme that minimizes the system travel cost under the worst-case tolled flow distribution. Finally, a further extension of the mathematical formulation for the UE conditions is provided.