Nonnegative Pareto-Improving Tolls with Multiclass Network Equilibria

Abstract

Congestion charging schemes are considered to be Pareto-improving if they lead to an improvement in system performance while ensuring that no user is worse off than in the situation without any tolling intervention. Anonymous nonnegative Pareto-improving charging schemes are considered in general road networks with multiple user classes, each valuing time differently. Mathematical programming models are proposed for finding a Pareto-improving scheme with heterogeneous users. The properties of the scheme are further analyzed, and the existence conditions are consequently established.

Get full access to this article

View all access options for this article.

References

Hau

T. D.

Economic Fundamentals of Road Pricing: A Diagrammatic Analysis, Part I—Fundamentals. Transportmetrica, Vol. 1, No. 2 2005, pp. 81–117.

Pigou

A. C.

The Economics of Welfare. MacMillan, New York, 1920.

Beckmann

McGuire

and Winston

Studies in the Economics of Transportation. Yale University Press, New Haven, Conn., 1956.

Brownstone

and Small

K. A.

Valuing Time and Reliability: Assessing the Evidence from Road Pricing Demonstrations. Transportation Research, Part A, Vol. 39, 2005, pp. 279–293.

Small

K. A.

and Yan

The Value of “Value Pricing” of Roads: Second-Best Pricing and Product Differentiation. Journal of Urban Economics, Vol. 49, 2001, pp. 310–336.

Small

K. A.

Winston

and Yan

Uncovering the Distribution of Motorists’ Preferences for Travel Time and Reliability. Econometrica, Vol. 73, 2005, pp. 1367–1382.

Yang

and Huang

H. J.

The Multi-Class, Multi-Criteria Traffic Network Equilibrium and System Optimum Problem. Transportation Research, Part B, Vol. 28, 2004, pp. 1–15.

Dafermos

S. C.

The Traffic Assignment Problem for Multi-Class User Transportation Networks. Transportation Science, Vol. 6, 1973, pp. 73–87.

Engelson

and Lindberg

P. O.

Congestion Pricing of Road Networks with Users Having Different Time Values. In Mathematical and Computational Models for Congestion Charging ( Lawphongpanich

Hearn

D. W.

and Smith

M. J.

, eds.), Springer, New York, 2006, pp. 81–104.

10.

Nagurney

A Multiclass, Multicriteria Traffic Network Equilibrium Model. Mathematical and Computer Modeling, Vol. 32, 2000, pp. 393–411.

11.

Yin

and Yang

Optimal Tolls with a Multiclass, Bicriteria Traffic Network Equilibrium. In Transportation Research Record: Journal of the Transportation Research Board, No. 1882, Transportation Research Board of the National Academies, Washington, D.C., 2004, pp. 45–52.

12.

Mayet

and Hansen

Congestion Pricing with Continuously Distributed Values of Time. Journal of Transport Economics and Policy, Vol. 34, 2000, pp. 359–370.

13.

Scheel

and Scholtes

Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity. Mathematics of Operations Research, Vol. 22, No. 1 2000, pp. 1–22.

14.

Ahuja

R. K.

Magananti

T. L.

and Orlin

J. B.

Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, N.J., 1993.

15.

Yang

and Zhang

Multiclass Network Toll Design Problem with Social and Spatial Equity Constraints. Journal of Transportation Engineering, Vol. 128, 2002, pp. 420–428.

16.

Jahn

Möhring

R. H.

Schulz

A. S.

Stier-Moses

N. E.

System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion. Operations Research, Vol. 53, 2005, pp. 600–616.

17.

Fisk

C. S.

Game Theory and Transportation Systems Modeling. Transportation Research, Part B, Vol. 18, 1984, pp. 301–313.

18.

Poundstone

Prisoner's Dilemma. Doubleday, New York, 1992.

19.

Hagstrom

J. N.

and Abrams

R. A.

Characterizing Braess's Paradox for Traffic Networks. In Proc., IEEE 2001 Conference on Intelligent Transportation Systems, Oakland, Calif., IEEE, Piscataway, N.J., 2002, pp. 837–842.

20.

Heran

D. W.

and Ramana

M. V.

Solving Congestion Toll Pricing Models. In Equilibrium and Advanced Transportation Modeling ( Marcoote

and Nguyen

, eds.), Kluwer Academic Publishers, Norwell, Mass., 1998, pp. 109–124.

21.

Chen

and Florian

The Nonlinear Bi-Level Programming Problem: Formulations, Regularity and Optimality Conditions. Optimization, Vol. 32, 1995, pp. 183–209.

22.

Bai

Hearn

D. W.

and Lawphongpanich

Decomposition Techniques for the Minimum Toll Revenue Problem. Networks, Vol. 14, No. 2 2004, pp. 142–150.

23.

Florian

Guélat

and Spiess

An Efficient Implementation of the PARTAN Variant of the Linear Approximation Method for the Network Equilibrium Problem. Networks, Vol. 17, 1987, pp. 319–339.