Relaxed Toll Sets for Congestion Pricing Problems

Congestion or toll pricing problems in [HeR98] require a solution to the system problem (the traffic assignment problem that minimizes the total travel delay) to define the set of all valid tolls or the toll set. For practical problems, it may not be possible to obtain an exact solution to the system problem and the inaccuracy in an approximate system solution may render the toll set empty. When this occurs, this paper offers alternative toll sets based on relaxed optimality conditions. With carefully chosen parameters, tolls from the relaxed toll sets are shown theoretically and empirically (using four transportation networks in the literature) to induce route choices that are nearly system optimal.

[1]  Donald W. Hearn,et al.  Decomposition techniques for the minimum toll revenue problem , 2004, Networks.

[2]  D. Hearn,et al.  Congestion Toll Pricing of Traffic Networks , 1997 .

[3]  Michael Florian,et al.  An efficient implementation of the "partan" variant of the linear approximation method for the network equilibrium problem , 1987, Networks.

[4]  H. M. Zhang,et al.  MODELING VARIABLE DEMAND EQUILIBRIUM UNDER SECOND-BEST ROAD PRICING , 2004 .

[5]  D. Hearn,et al.  Chapter 6 Network equilibrium models and algorithms , 1995 .

[6]  Anna Nagurney,et al.  Sensitivity analysis for the asymmetric network equilibrium problem , 1984, Math. Program..

[7]  Nathan H. Gartner,et al.  Optimal Traffic Assignment with Elastic Demands: A Review Part I. Analysis Framework , 1980 .

[8]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[9]  K. Small,et al.  The Economics Of Traffic Congestion , 1993 .

[10]  Robert B. Dial,et al.  Minimal-revenue congestion pricing part I: A fast algorithm for the single-origin case , 1999 .

[11]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[12]  D. Hearn,et al.  A Toll Pricing Framework for Traffic Assignment Problems with Elastic Demand , 2002 .

[13]  Mohammad Mahdian,et al.  Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[14]  D. Hearn,et al.  Solving Congestion Toll Pricing Models , 1998 .

[15]  S. M. Robinson.  Bounds for error in the solution set of a perturbed linear program , 1973 .

[16]  Donald W. Hearn,et al.  The gap function of a convex program , 1982, Operations Research Letters.

[17]  Donald W. Hearn,et al.  Computational methods for congestion toll pricing models , 2001, ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585).

[18]  Hai Yang,et al.  TRAFFIC RESTRAINT, ROAD PRICING AND NETWORK EQUILIBRIUM , 1997 .

[19]  J. A. Ventura,et al.  Restricted simplicial decomposition: computation and extensions , 1987 .

[20]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .