Complementing distance based charges with discounted registration fees in the reform of road user charges: the impact for motorists and government revenue

The call for a congestion charge is getting louder and more frequent in many countries as major metropolitan areas experience increasing levels of road congestion. This is often accompanied by a recognition that governments need to find new sources of revenue to maintain existing road networks and to invest in new transport infrastructure. Although reform of road pricing is almost certain to occur at some time in the future in a number of countries, a key challenge is in selling the idea to the community of road users as well as a whole raft of interest groups that influence the views of society and politicians. Simply announcing a need for a congestion charge (often misleadingly called a tax) does little to progress the reform agenda. What is required is a carefully structured demonstration of what might be done to progressively introduce adjustments in road user charges that are seen as reducing the costs to motorists while ensuring no loss of revenue to government. In this paper we show, in the context of Sydney (Australia), that this can be achieved by the reform of registration fees in the presence of a distance-based charging regime that can deliver financial gains to motorists, with prospects of revenue growth to the State Treasury.     

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.     

Distributional effects of road pricing: Assessment of nine scenarios for Paris

The starting point of this paper is to consider that there is no general answer to the question of the equity of urban road pricing. We therefore simulate and compare the distributional effects on commuters of nine toll scenarios for Paris, assuming that utility is nonlinear in income. We show that the distributional pattern across income groups depends crucially on the level of traffic reduction induced by tolling. Stringent tolls are more favourable to low-income motorists. Equity effects also vary with toll design. Compared to a reference scenario which uniformly charges all motorists driving within Paris, an inbound cordon toll is detrimental to low-incomes. Conversely, granting a rebate to low CO₂ emission cars slightly improves their situation while an exemption for Paris residents is neutral. Surprisingly, it matters little for social equity whether toll revenues are allocated to all commuters or solely to public transport users.     

Optimal distribution of financial incentives to foster off-hour deliveries in urban areas

The main objective of this paper is to develop mathematical formulations to gain insight into the best way to distribute financial incentives to receivers of urban deliveries to maximize participation in off-hour deliveries. The paper considers two different types of incentive budgets: exogenous, and endogenous. The exogenous case represents the condition in which an external decision maker determines the incentive budget that is to be distributed among potential participants in off-hour deliveries. In the case of an endogenous incentive budget, the entity distributing the incentives must raise the necessary funds using revenue generation mechanisms such as tolls and fines. The optimal incentives are obtained from the Karush–Kuhn–Tucker conditions of a mathematical program that maximizes the number of truck trips shifted to the off-hours as a function of the incentives. The mathematical models developed in this paper provide guidelines about how to optimally distribute financial incentives to foster off-hour deliveries.     

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.     

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 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.     

A note on the distortionary effects of revenue-neutral tolls in a bottleneck congestion game

This note demonstrates how the redistribution of revenue from a Pigouvian policy can distort incentives and handicap the social objectives of the policy by creating a moral hazard problem. Based on the Levinson (2005) game theory model, I develop a three-player bottleneck congestion game that emulates a repeated prisoner’s dilemma and derive efficient tolls. This conceptual game demonstrates the distortionary effects from a revenue-neutral toll policy with lump-sum revenue redistribution and the equity-efficiency tradeoff.     

Efficiency and equity comparison of cordon- and area-based road pricing schemes using a trip-chain equilibrium model

This paper compares performances of cordon- and area-road pricing regimes on their social welfare benefit and equity impact. The key difference between the two systems is that the cordon charges travellers per crossing whereas the area scheme charges the travellers for an entry permit (e.g. per day). For the area licensing scheme, travellers may decide to pay or not to pay the toll depending on the proportion between their travel costs for the whole trip-chains during a valid period of the area license and the toll level. A static trip-chain equilibrium based model is adopted in the paper to provide a better evaluation of the area-based tolls on trip-chain demands. The paper proposes a modified Gini coefficient taking in account assumptions of revenue re-distribution to measure the spatial equity impact. The model is tested with the case study of the Utsunomiya city in Japan. The results demonstrate a higher level of optimal tolls and social welfare benefits of the area-based schemes compared to those of the cordon-based schemes. Different sizes of the charging boundary have significant influences on the scheme benefits. The tests also show an interesting result on the non-effect of the boundary design (for both charging types) on their equity impacts. However, when comparing between charging regimes it is clear that the area schemes generate more inequitable results.     

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.     

Dynamic pricing for managed lanes with multiple entrances and exits

Priced managed lanes are increasingly being used to better utilize the existing capacity of the roadway to relieve congestion and offer reliable travel time to road users. In this paper, we investigate the optimization problem for pricing managed lanes with multiple entrances and exits which seeks to maximize the revenue and minimize the total system travel time (TSTT) over a finite horizon. We propose a lane choice model where travelers make online decisions at each diverge point considering all routes on a managed lane network. We formulate the problem as a deterministic Markov decision process and solve it using the value function approximation (VFA) method for different initializations. We compare the performance of the toll policies predicted by the VFA method against the myopic revenue policy which maximizes the revenue only at the current timestep and two heuristic policies based on the measured densities on the managed and general purpose lanes (GPLs). We test the results on four different test networks. The primary findings from our research suggest the usefulness of the VFA method for determining dynamic tolls. The best-found objective value from the method at its termination is better than other heuristics for all test networks with average improvements in the objective ranging between 10% and 90% for revenue maximization and 0–27% for TSTT minimization. Certain VFA initializations obtain best-found toll profiles within first 5–50 iterations which warrants computational time savings. Our findings also indicate that the revenue-maximizing optimal policies follow the “jam-and-harvest” behavior where the GPLs are pushed towards congestion in the earlier time steps to generate higher revenue in the later time steps, a characteristic not observed for the policies minimizing TSTT.     

Regulating hazardous materials transportation by dual toll pricing

We investigate dual-toll setting as a policy tool to mitigate the risk of hazardous material (hazmat) shipment in road networks. We formulate the dual-toll problem as a bi-level program wherein the upper level aims at minimizing the risk, and the lower level explores the user equilibrium decision of the regular vehicles and hazmat carriers given the toll. When the upper level objective is to minimize the risk and all links are tollable, we decompose the formulation into first-stage and second-stage, and suggest a computational method to solve each stage. Our two-stage solution methodology guarantees nonnegative valid dual tolls regardless of the solution accuracy of the first-stage problem. We also consider a general dual-toll setting problem where the regulator rather wishes to minimize a combination of risk and the paid tolls and/or some links are untollable. To solve this truly bilevel problem, we provide heuristic algorithms that decompose the problem into subproblems each being solved by a line search. Case studies based on the Sioux Falls network illustrate the insights on the dual-toll policies.     

Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach

Path travel time reliability is an essential measure of the quality of service for transportation systems and an important attribute in travelers’ route and departure time scheduling. This paper investigates a fundamental problem of finding the most reliable path under different spatial correlation assumptions, where the path travel time variability is represented by its standard deviation. To handle the non-linear and non-additive cost functions introduced by the quadratic forms of the standard deviation term, a Lagrangian substitution approach is adopted to estimate the lower bound of the most reliable path solution through solving a sequence of standard shortest path problems. A subgradient algorithm is used to iteratively improve the solution quality by reducing the optimality gap. To characterize the link travel time correlation structure associated with the end-to-end trip time reliability measure, this research develops a sampling-based method to dynamically construct a proxy objective function in terms of travel time observations from multiple days. The proposed algorithms are evaluated under a large-scale Bay Area, California network with real-world measurements.     

Learning marginal-cost pricing via a trial-and-error procedure with day-to-day flow dynamics

This paper investigates the convergence of the trial-and-error procedure to achieve the system optimum by incorporating the day-to-day evolution of traffic flows. The path flows are assumed to follow an ‘excess travel cost dynamics’ and evolve from disequilibrium states to the equilibrium day by day. This implies that the observed link flow pattern during the trial-and-error procedure is in disequilibrium. By making certain assumptions on the flow evolution dynamics, we prove that the trial-and-error procedure is capable of learning the system optimum link tolls without requiring explicit knowledge of the demand functions and flow evolution mechanism. A methodology is developed for updating the toll charges and choosing the inter-trial periods to ensure convergence of the iterative approach towards the system optimum. Numerical examples are given in support of the theoretical findings.     

Auction-based tolling systems in a connected and automated vehicles environment: Public opinion and implications for toll revenue and capacity utilization

Autonomous and connected vehicles are expected to enable new tolling mechanisms, such as auction-based tolls, for allocating the limited roadway capacity. This research examines the public perception of futuristic auction-based tolling systems, with a focus on the public acceptance of such systems over current tolling practices on highways (e.g., dynamic and fixed tolling methodologies). Through a stated-preference survey, responses from 159 road-users residing in Virginia are elicited to understand route choice behavior under a descending price auction implemented on a hypothetical two-route network. Analysis of the survey data shows that there is no outright rejection of the presented auction-based tolling among those who are familiar with the current tolling methods. While males strongly support the new method, no clear pattern emerges among other demographic variables such as income and education level, and age. While high income respondents and regular commuters are more likely to pay higher tolls, no statistical significance between different genders, age groups, household sizes, and education levels is found. Based on the modeling results and the hypothetical road network, it is found that descending price tolling method yields higher average toll rates, and generates at least 70% more revenue when travel time saving is 30 min, and improves capacity utilization of the toll road significantly compared to fixed tolls.     

Optimizing path query performance: graph clustering strategies

Path queries over transportation networks are operations required by many Geographic Information Systems applications. Such networks, typically modeled as graphs composed of nodes and links and represented as link relations, can be very large and hence often need to be stored on secondary storage devices. Path query computation over such large persistent networks amounts to high I/O costs due to having to repeatedly bring in links from the link relation from secondary storage into the main memory buffer for processing. This paper is the first to present a comparative experimental evaluation of alternative graph clustering solutions in order to show their effectiveness in path query processing over transportation networks. Clustering optimization is attractive because it does not incur any run-time cost, requires no auxiliary data structures, and is complimentary to many of the existing solutions on path query processing. In this paper, we develop a novel clustering technique, called spatial partition clustering (SPC), that exploits unique properties of transportation networks such as spatial coordinates and high locality. We identify other promising candidates for clustering optimizations from the literature, such as two-way partitioning and approximate topological clustering. We fine-tune them to optimize their I/O behavior for path query processing. Our experimental evaluation of the performance of these graph clustering techniques using an actual city road network as well as randomly generated graphs considers variations in parameters such as memory buffer size, length of the paths, locality, and out-degree. Our experimental results are the foundation for establishing guidelines to select the best clustering technique based on the type of networks. We find that our SPC performs the best for the highly interconnected city map; the hybrid approach for random graphs with high locality; and the two-way partitioning based on link weights for random graphs with no locality.     

Flexible-term contracts for road franchising

Private participation in road projects is increasing around the world. The most popular form of franchising is a concession contract, which allows a private firm to charge tolls to road users during a pre-determined period in order to recover investments. Concessionaires are usually selected through auctions at which candidates submit bids for tolls or payments to the government. This paper discusses how this mechanism does not generally yield optimal outcomes and it induces the frequent contract renegotiations observed in practice. A new franchising mechanism is proposed, based on a flexible-term contract and bi-dimensional bids for total net revenue and maintenance costs. This new mechanism improves outcomes compared to fixed-term concessions, by eliminating traffic risk and promoting the selection of efficient concessionaires.     

An improved Dial's algorithm for logit-based traffic assignment within a directed acyclic network

Abstract

Dial's algorithm is one of the most effective and popular procedures for a logit-type stochastic traffic assignment, as it does not require path enumeration over a network. However, a fundamental problem associated with the algorithm is its simple definition of ‘efficient paths’, which sometimes produces unrealistic flow patterns. In this paper, an improved algorithm based on the route extension coefficient is proposed in order to circumvent this problem, in which ‘efficient paths’ simultaneously consider link travel cost and minimum travel cost. Path enumeration is still not required and a similar computing efficiency with the original algorithm is guaranteed. A limitation of the algorithm is that it can only be applied to a directed acyclic network because a topological sorting algorithm is used to decide the order of the sequential calculation. A numerical example based on the Beijing subway network illustrates the effectiveness of the proposed algorithm. It is found that it is able to exclude most unrealistic paths, but include all reasonable paths when compared with path enumeration and the original Dial's algorithm.     

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.     

Tolling traffic links under stochastic assignment: Modelling the relationship between the number and price level of tolled links and optimal traffic flows

The classical road-tolling problem is to toll network links such that under the principles of Wardropian User Equilibrium Assignment a System Optimising (SO) flow pattern is obtained. Stochastic assignment methods are accepted to be more realistic than deterministic and it is of interest to examine the potential for optimal tolling in the case of Stochastic User Equilibrium (SUE). In examining the case of Stochastic User Equilibrium the ‘desired flow pattern’ to be created must first be determined. The classical economics solution of replacing unit-cost flow functions with marginal-cost flow functions which under deterministic assignment produces the System Optimal solution (where Total Network Travel Cost (TNTC) is minimised) does not generally result in TNTC being minimised in the Stochastic Case. Instead such tolls produce a ‘Stochastic System Optimal’ (SSO) solution where the Total Perceived Network Travel Cost (TPNTC) is minimised.This paper examines and compares link-based tolling solutions to achieve both the SSO (TPNTC minimised) and true SO (TNTC minimised) under SUE and illustrates the concept with numerical examples. Such link-based tolling schemes produce network benefit by re-routing rather than traffic suppression as opposed to the cordon-based charging schemes which have been implemented in practice. Equity issues relating to charging schemes are discussed and the desirability of zero-toll routes is highlighted associated with greater potential political acceptability of charging schemes that do not impose excessive charges upon users (such as minimal or low revenue tolls). A heuristic is developed to toll network links in such a way as to balance the number of links tolled against the revenue required to produce a desired reduction in TNTC such that optimal network flow patterns are approached.