Congestion pricing under operational,supply-side uncertainty

This paper is concerned with finding first-best tolls in static transportation networks with day-to-day variation in network capacity, as accounted for by changes in the volume-delay function. The key question in addressing this problem is that of information, namely, which agents have access to what information when making decisions. In this work, travelers are assumed to be either fully informed about network conditions before embarking on travel, or having no information except the probability distributions; likewise, the network manager (toll-setter) is either able to vary tolls in response to realized network conditions, or must apply the same tolls every day. Further, travelers’ preference for reliable travel is accounted for, representing risk aversion in the face of uncertainty. For each of the scenarios implied by combinations of these assumptions, we present methods to determine system-optimal link prices. A demonstration is provided, using the Sioux Falls test network, suggesting that attempts to incorporate uncertainty into nonresponsive tolls involve significantly higher prices.     

Path-differentiated pricing in congestion mitigation

Instead of charging tolls on individual links, this paper considers doing the same on paths. Path and link tolls are “valid” if they encourage motorists to use routes that collectively lead to a target distribution, e.g., one that minimizes travel delay. Because the numbers of valid link and path tolls are typically infinite, an objective in pricing tolls is to find a set of valid tolls that yields the least revenue to lessen the financial burden on motorists.Path tolls are generally more flexible than link tolls and this paper shows that this flexibility can substantially reduce the financial burden on motorists. Additionally, valid path tolls yielding the least revenue possess characteristics with interesting policy implications. To determine these path tolls, it is natural to formulate the problem as a mathematical program with complementarity constraints. However, this paper also investigates alternative formulations that highlight the problem’s complexity and suggest ways to solve the problem efficiently.     

Pareto-improving transportation network design and ownership regimes

Private provision of public roads signifies co-existence of free, public-tolled and private-tolled roads. This paper investigates the Pareto-improving transportation network design problem under various ownership regimes by allowing joint choice of road pricing and capacity enhancement on free links. The problem of interest is formulated as a bi-objective mathematical programming model that considers the travel cost of road users in each origin-destination pair and the investment return of the whole network. The non-dominated Pareto-improving solutions of toll and/or capacity enhancement schemes are sought for achieving a win-win situation. A sufficient condition is provided for the existence of the non-dominated Pareto-improving schemes and then the properties of those schemes are analyzed. It is found that, under some mild assumptions, the optimal capacity enhancement is uniquely determined by the link flow under any non-dominated Pareto-improving scheme. As a result, the joint road pricing and capacity enhancement problem reduces to a bi-objective second-best road pricing problem. A revenue distribution mechanism with return rate guarantee is proposed to implement the non-dominated Pareto-improving schemes.     

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.     

Network reliability‐based optimal toll design

Optimal toll design from a network reliability point of view is addressed in this paper. Improving network reliability is proposed as a policy objective of road pricing. A reliability‐based optimal toll design model, where on the upper level network performance including travel time reliability is optimized, while on the lower level a dynamic user‐equilibrium is achieved, is presented. Road authorities aim to optimize network travel time reliability by setting tolls in a network design problem. Travelers are influenced by these tolls and make route and trip decisions by considering travel times and tolls. Network performance reliability is analyzed for a degradable network with elastic and fluctuated travel demand, which integrates reliability and uncertainty, dynamic network equilibrium models, and Monte Carlo methods. The proposed model is applied to a small hypothesized network for which optimal tolls are derived. The network travel time reliability is indeed improved after implementing optimal tolling system. Trips may have a somewhat higher, but more reliable, travel time.     

Morning commute problem considering route choice, user heterogeneity and alternative system optima

This paper extends the bottleneck model to study congestion behavior of morning commute and its implications to transportation economics. The proposed model considers simultaneous route and departure time choices of heterogenous users who are distinguished by their valuation of travel time and punctual arrival. Moreover, two dynamic system optima are considered: one minimizes system cost in the unit of monetary value (i.e., the conventional system optimum, or SO) and the other minimizes system cost in the unit of travel time (i.e., the time-based SO, or TSO). Analytical solutions of no-toll equilibrium, SO and TSO are provided and the welfare effects of the corresponding dynamic congestion pricing options are examined, with and without route choice. The analyses suggest that TSO provides a Pareto-improving solution to the social inequity issue associated with SO. Although a TSO toll is generally discriminatory, anonymous TSO tolls do exist under certain circumstances. Unlike in the case with homogenous users, an SO toll generally alters users’ route choices by tolling the poorer users off the more desirable road, which worsens social inequity. Numerical examples are presented to verify analytical results.     

Travel mental budgeting under road toll: An investigation based on user equilibrium

With the approach of introducing the conceptions of mental account and mental budgeting into the process of travelers’ route choice, we try to identify why the usages of tolled roads are often overestimated. Assuming that every traveler sets a mental account for his/her travel to keep track of their expense and keep out-of-pocket spending under control, it addresses these questions such that “How much money can I spend on the travel?” and “What if I spend too much?”. Route tolls that exceed the budget are much more unacceptable compared to those within budget due to the non-fungibility of money between different accounts. A simple network with two nodes and two routes is analyzed firstly, the analytical solutions are obtained and the optimal road tolls supporting the user equilibrium as a system optimum are also derived. The proposed model is then extended to a generalized network. The multiclass user equilibrium conditions with travel mental budgeting are formulated into an equivalent variational inequality (VI) problem and an equivalent minimization problem. Through analyses with numerical examples, it is found that the main reason that the usages of high tolled roads are often overestimated is due to the fact that travelers with low and moderate out-of-pocket travel budget perceive a much higher travel cost than their actual cost on the high tolled roads.     

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.     

Optimal tolls for multi-class traffic: Analytical formulations and policy implications

This paper puts together an analytical formulation to compute optimal tolls for multi-class traffic. The formulation is comprised of two major modules. The first one is an optimization component aimed at computing optimal tolls assuming a Stackelberg game in which the toll agency sets the tolls, and the equilibrating traffic plays the role of the followers. The optimization component is supported by a set of cost models that estimate the externalities as a function of a multivariate vector of traffic flows. These models were estimated using Taylor series expansions of the output obtained from traffic simulations of a hypothetical test case. Of importance to the paper is the total travel time function estimated using this approach that expresses total travel time as a multivariate function of the traffic volumes. The formulation presented in the paper is then applied to a variety of scenarios to gain insight into the optimality of current toll policies. The optimal tolls are computed for two different cases: independent tolls, and tolls proportional to passenger car equivalencies (PCE).The numerical results clearly show that setting tolls proportional to PCEs leads to lower values of welfare that are on average 15% lower than when using independent tolls, though, in some cases the total welfare could be up to 33% lower. This is a consequence of two factors. First, the case of independent tolls has more degrees of freedom than the case of tolls proportional to PCEs. Second, tolls proportional to PCEs do not account for externalities other than congestion, which is likely to lead to lower welfare values.The analytical formulations and numerical results indicate that, because the total travel time is a non-linear function of the traffic volumes, the marginal social costs and thus the optimal congestion tolls also depend on the traffic volumes for each vehicle class. As a result of this, for the relatively low volumes of truck traffic observed in real life, the optimal congestion tolls for trucks could indeed be either lower or about the same as for passenger cars. This stand in sharp contrast with what is implied in the use of PCEs, i.e., that the contribution to congestion are constant. This latter assumption leads to optimal truck congestion tolls that are always proportional to the PCE values.The comparison of the toll ratios (truck tolls divided by passenger car tolls) for both observed and optimal conditions suggests that the tolls for small trucks are about the right level, maybe a slightly lower than optimal. However, the analysis of the toll ratio for large trucks seems to indicate a significant overcharge. The estimates show that the average observed toll ratio for large trucks is even higher than the maximum optimal toll ratio found in the numerical experiments. This suggests that the tolls for large trucks are set on the basis of revenue generation principles while the passenger car tolls are being set based on a mild form of welfare maximization. This leads to a suboptimal cross-subsidization of passenger car traffic in detriment of an important sector of the economy.     

Optimal selection of build-operate-transfer projects on transportation networks

This paper considers the problem of how to select highway projects for the build-operate-transfer (BOT) development with the objective of improving the social benefit while ensuring the marketability of those selected. The problem can be viewed as a tri-level leader-follower game and is formulated as a mixed integer program with equilibrium constraints. Without solving the associated problem, we show that optimal tolls and travel times on selected BOT highways can be determined from their attributes under mild assumptions. This leads to an efficient heuristic algorithm for solving the project selection problem.     

Fuel saving and ridesharing in the US: Motivations,limitations, and opportunities

Ridesharing can reduce the fuel consumed in noncommercial passenger highway vehicles by grouping individuals into fewer vehicles and reducing the number of miles that vehicles must travel. We estimate the potential fuel savings that could result from an increase in ridesharing in the US. If no additional travel is required to pick up passengers, adding one additional passenger for every 100 vehicles would reduce annual fuel consumption by 0.80–0.82 billion gallons of gasoline per year; if one passenger were added in every 10 vehicles, the potential savings would be 7.54–7.74 billion gallons per year. However, ridesharing may require extra travel to pick up additional passengers, which can reduce and possibly eliminate potential fuel savings. The tradeoff between saving fuel and spending time to pick up additional passengers is investigated, finding that, on average, ridesharing may not be attractive to travelers, but can be made more attractive by increasing per-vehicle-trip costs such as parking and tolls.     

Pareto-improving ramp metering strategies for reducing congestion in the morning commute

This paper presents an alternative approach to internalize congestion externality during the morning commute. We consider a linear freeway with multiple on-ramps and a downstream bottleneck and commuters accessing the freeway via different on-ramps try to arrive at work on time. Rather than charging congestion tolls as widely suggested by economists, we show that the old-fashioned engineering approach – ramp metering – can be a powerful tool to affect travelers’ departure time choice and thereby alter the congestion externality distribution among travelers. With carefully designed time-dependent metering plans, travelers from different origins can be channelized and will access the freeway bottleneck in different time periods, resulting in less total cost for the system compared to the no-metering case. The metering strategies are Pareto-improving, with travelers from the on-ramp with the highest priority having the smallest individual costs and travelers from the on-ramp with the lowest priority having their costs equal to those in the no-metering scenario. By changing the priority order of the ramps periodically, the benefit of the Pareto-improving metering strategies can be distributed evenly among all travelers. Numerical experiments show that the total user cost can be reduced by up to 40% with the proposed metering strategies. This study offers researchers and policy makers a different angle of looking at congestion externality, and the results provide an overview of the potential long term benefits that dynamic ramp metering strategies can achieve.     

Managing network mobility with tradable credits

A system of tradable travel credits is explored in a general network with homogeneous travelers. A social planner is assumed to initially distribute a certain number of travel credits to all eligible travelers, and then there are link-specific charges to travelers using that link. Free trading of credits among travelers is assumed. For a given credit distribution and credit charging scheme, the existence of a unique equilibrium link flow pattern is demonstrated with either fixed or elastic demand. It can be obtained by solving a standard traffic equilibrium model subject to a total credit consumption constraint. The credit price at equilibrium in the trading market is also conditionally unique. The appropriate distribution of credits among travelers and correct selection of link-specific rates is shown to lead to the most desirable network flow patterns in a revenue-neutral manner. Social optimum, Pareto-improving and revenue-neutral, and side-constrained traffic flow patterns are investigated.     

Minimal-revenue congestion pricing Part II: An efficient algorithm for the general case

The second of a two-part series, this paper derives an efficient solution to the minimal-revenue tolls problem. As introduced in Part I, this problem can be defined as follows: Assuming each trip uses only a path whose generalized cost is smallest, find a set of arc tolls that simultaneously minimizes both average travel time and out-of-pocket cost. As a point of departure, this paper first re-solves the single-origin problem of Part I, modeling it as a linear program. Then with a change of variable, it transforms the LP's dual into a simple longest-path problem on an acyclic network. The multiple-origin problem – where one toll for each arc applies to all origins – solves analogously. In this case, however, the dual becomes an elementary linear multi-commodity max-cost flow problem with an easy bundling constraint and infinite arc capacities. After a minor reformulation that simplifies the model's input to better accommodate output from common traffic assignment software, a solution algorithm is exemplified with a numerical example.     

Optimal toll locations and toll levels in congestion pricing schemes: a case study of Stockholm

As congestion pricing has moved from theoretical ideas in the literature to real-world implementation, the need for decision support when designing pricing schemes has become evident. This paper deals with the problem of finding optimal toll levels and locations in a road traffic network and presents a case study of Stockholm. The optimisation problem of finding optimal toll levels, given a predetermined cordon, and the problem of finding both optimal toll locations and levels are presented, and previously developed heuristics are used for solving these problems. For the Stockholm case study, the possible welfare gains of optimising toll levels in the current cordon and optimising both toll locations and their corresponding toll levels are evaluated. It is shown that by tuning the toll levels in the current congestion pricing cordon used in Stockholm, the welfare gain can be increased significantly, and furthermore improved by allowing a toll on a major bypass highway. It is also shown that, by optimising both toll locations and levels, a congestion pricing scheme with welfare gain close to what can be achieved by marginal social cost pricing can be designed with tolls being located on only a quarter of the tollable links.     

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.     

Travel time estimation from sparse floating car data with consistent path inference: A fixed point approach

Estimation of urban network link travel times from sparse floating car data (FCD) usually needs pre-processing, mainly map-matching and path inference for finding the most likely vehicle paths that are consistent with reported locations. Path inference requires a priori assumptions about link travel times; using unrealistic initial link travel times can bias the travel time estimation and subsequent identification of shortest paths. Thus, the combination of path inference and travel time estimation is a joint problem. This paper investigates the sensitivity of estimated travel times, and proposes a fixed point formulation of the simultaneous path inference and travel time estimation problem. The methodology is applied in a case study to estimate travel times from taxi FCD in Stockholm, Sweden. The results show that standard fixed point iterations converge quickly to a solution where input and output travel times are consistent. The solution is robust under different initial travel times assumptions and data sizes. Validation against actual path travel time measurements from the Google API and an instrumented vehicle deployed for this purpose shows that the fixed point algorithm improves shortest path finding. The results highlight the importance of the joint solution of the path inference and travel time estimation problem, in particular for accurate path finding and route optimization.     

Pareto-improving congestion pricing and revenue refunding with multiple user classes

This study investigates Pareto-improving congestion pricing and revenue refunding schemes in general transportation networks, which make every road user better off as compared with the situation without congestion pricing. We consider user heterogeneity in value of time (VOT) by adopting a multiclass user model with fixed origin–destination (OD) demands. We first prove that an OD and class-based Pareto-improving refunding scheme exists if and only if the total system monetary travel disutility is reduced. In view of the practical difficulty in identifying individual user’s VOT, we further investigate class-anonymous refunding schemes that give the same amount of refund to all user classes traveling between the same OD pair regardless of their VOTs. We establish a sufficient condition for the existence of such OD-specific but class-anonymous Pareto-improving refunding schemes, which needs information only on the average toll paid and average travel time for trips between each OD pair.     

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.     

Drivers’ willingness-to-pay to reduce travel time: evidence from the San Diego I-15 congestion pricing project

The adoption of congestion pricing depends fundamentally upon drivers’ willingness to pay to reduce travel time during the congested morning peak period. Using revealed preference data from a congestion pricing demonstration project in San Diego, we estimate that willingness to pay to reduce congested travel time is higher than previous stated preference results. Our estimate of median willingness to pay to reduce commute time is roughly $30 per hour, although this may be biased upward by drivers’ perception that the toll facility provides safer driving conditions. Drivers also use the posted toll as an indicator of abnormal congestion and increase their usage of the toll facility when tolls are higher than normal.