Decomposition techniques for the minimum toll revenue problem

The objective of the minimum toll revenue (MINREV) problem is to find tolls that simultaneously cause users to use the transportation network efficiently and minimize the total toll revenues that must be collected. This article investigates the Dantzig-Wolfe (DW) decomposition as an approach for solving the MINREV problem and establishes its relationships with a cutting plane algorithm and other proposed approaches. The article also identifies the variant of DW decomposition most suitable for implementation. Numerical experiments with real transportation networks suggest that DW decomposition is robust and should be used when the problems are too large for standard linear programming software. Although transportation planning is the application emphasized in this article, it should be noted that the MINREV problem also has applications in telecommunication network design and control. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(2), 142–150 2004

[1]  Erik T. Verhoef,et al.  Second-best congestion pricing in general static transportation networks with elastic demands , 2002 .

[2]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[3]  Daniel Bienstock,et al.  Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice , 2002 .

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

[5]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[6]  Patrice Marcotte,et al.  A Bilevel Programming Approach to Optimal Price Setting , 2002 .

[7]  Hillel Bar-Gera,et al.  Origin-Based Algorithm for the Traffic Assignment Problem , 2002, Transp. Sci..

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

[9]  Di Yuan,et al.  An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing , 2004, Comput. Optim. Appl..

[10]  P. Ferrari.  Road pricing and network equilibrium , 1995 .

[11]  Ramesh Johari,et al.  Number 2 Mathematical Modeling and Control of Internet Congestion , 2000 .

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

[13]  Robert B. Dial,et al.  MINIMAL-REVENUE CONGESTION PRICING PART II: AN EFFICIENT ALGORITHM FOR THE GENERAL CASE , 2000 .

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

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

[16]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[17]  M. Patriksson,et al.  SIDE CONSTRAINED TRAFFIC EQUILIBRIUM MODELS: TRAFFIC MANAGEMENT THROUGH LINK TOLLS. , 1998 .

[18]  Erik T. Verhoef,et al.  SECOND-BEST CONGESTION PRICING IN GENERAL NETWORKS. HEURISTIC ALGORITHMS FOR FINDING SECOND-BEST OPTIMAL TOLL LEVELS AND TOLL POINTS , 2002 .

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

[20]  D. Hearn,et al.  Network Equilibrium and Pricing , 2003 .

[21]  Bethany L. Nicholson,et al.  Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.

[22]  Donald W. Hearn,et al.  1 SOLVING CONGESTION TOLL PRICING MODELS , 1999 .

[23]  J. Mcdonald.  URBAN HIGHWAY CONGESTION. AN ANALYSIS OF SECOND-BEST TOLLS , 1995 .

[24]  P. Nijkamp,et al.  SECOND BEST CONGESTION PRICING: THE CASE OF AN UNTOLLED ALTERNATIVE. IN: URBAN TRANSPORT , 1996 .

[25]  John F. McDonald,et al.  Economic efficiency of second-best congestion pricing schemes in urban highway systems , 1999 .

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

[27]  Robert E. Bixby,et al.  Solving Real-World Linear Programs: A Decade and More of Progress , 2002, Oper. Res..

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

[29]  P. Marcotte,et al.  A bilevel model of taxation and its application to optimal highway pricing , 1996 .

[30]  J. Mcdonald,et al.  Urban highway congestion , 1995 .

[31]  E. Verhoef.  SECOND-BEST CONGESTION PRICING IN GENERAL NETWORKS Algorithms for finding second-best optimal toll levels and toll points , 2000 .

[32]  Richard Cole,et al.  Pricing network edges for heterogeneous selfish users , 2003, STOC '03.