Network Optimization pp 51-71 | Cite as
Congestion Toll Pricing of Traffic Networks
Abstract
This paper concerns tolling methodologies for traffic networks which ensure that the resultant equilibrium flows are system optimal. A nonnegative vector β is defined to be a valid toll vector, if the set of tolled user equilibrium solutions is a subset of the set of untolled system optimal solutions. The problem of characterizing the toll set τ, which is the set of all valid toll vectors, is studied. Descriptions and characterizations of τ are given for the cases when either the cost map is strictly monotonic or is affine monotonic. In the latter case, the cost map is of the form Qυ + c, where Q is a not necessarily symmetric matrix and Q + Q T is positive semidefinite. The results are illustrated with several examples.
Keywords
User Equilibrium Traffic Assignment Congestion Price Feasible Flow Traffic Assignment ProblemPreview
Unable to display preview. Download preview PDF.
References
- 1.I. Adler and D. Gale, On the Solutions of the Positive Semidefinite Complementarity Problem, Technical Report ORC 75-12, Operations Research Center, University of California, Berkeley, 1975Google Scholar
- 2.R. Arnott and K. Small, The Economics of Traffic Congestion, American Scientist, Vol.82, 1994, pp.446–455Google Scholar
- 3.P. Bergendorff, The Bounded Flow Approach to Congestion Pricing, Master’s Thesis, The Royal Institute of Technology, Stockholm, Sweden, 1995. Advisor: D.W. HearnGoogle Scholar
- 4.R. Cottle, J-S. Pang and R. Stone, The Linear Complementarity Problem, Academic Press, 1992Google Scholar
- 5.S.C. Dafermos, Toll Patterns for Multiclass-User Transportation Networks, Transportation Science, Vol.7, 1973, pp.211–223CrossRefGoogle Scholar
- 6.M. Florian and D. Hearn, Network Equlibrium Models and Algorithms, Network Routing, M.O. Ball et al., Eds., Handbooks in OR and MS, Vol.8, Elsevier Science, 1995Google Scholar
- 7.D.W. Hearn, Bounding Flows in Traffic Assignment Models, Research report No. 80-4, Dept. of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611. 1980Google Scholar
- 8.D.W. Hearn, The Gap Function of a Convex Program, OR Letters, Vol1, pp.67–71, 1982Google Scholar
- 9.D.W. Hearn and J. Ribera, Bounded Flow Equilibrium by Penalty Methods, In: Proceedings of the IEEE International Conference on Circuits and Computers, Vol.1, 1980, pp.162–164Google Scholar
- 10.F.H. Knight, Some Fallacies in the Interpretation of Social Cost, Quarterly Journal of Economics, Vol.38, 1924, pp.582–606CrossRefGoogle Scholar
- 11.O.L. Mangasarian, A Simple Characterization of Solution Sets of Convex Programs, O.R. Letters, Vol.7, No.1, 1988Google Scholar
- 12.S.A. Morrison, A Survey of Road Pricing, Transportation Research Vol.20A(2), 1986, pp.87–97Google Scholar
- 13.Y. Nesterov and A. Nemirovskii, Interior Point Polynomial Methods for Convex Programming: Theory and Applications, SIAM, 1994Google Scholar
- 14.M. Netter, Affectations de Trafic et Tarification au Coût Marginal Social: Critique de Quelques Idees Admises, Transportation Research Vol.6, 1972Google Scholar
- 15.A.C. Pigou, The Economics of Welfare, MacMillan, New York, 1920Google Scholar
- 16.M.V. Ramana, An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems, Ph.D. Thesis, The Johns Hopkins University, Baltimore, 1993Google Scholar
- 17.M.J. Smith, The Marginal Cost Taxation of a Transportation Network, Transportation Research Vol.13B, 1979, pp.237–242Google Scholar
- 18.A.A. Walters, The Theory and Measurement of Private and Social Cost of Highway Congestion, Econometrica, Vol.29, 1961, pp.676–699CrossRefGoogle Scholar