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
1.
HauT. D.Economic Fundamentals of Road Pricing: A Diagrammatic Analysis, Part I—Fundamentals. Transportmetrica, Vol. 1, No. 22005, pp. 81–117.
2.
PigouA. C.The Economics of Welfare.MacMillan, New York, 1920.
3.
BeckmannM.McGuireC. and WinstonC.Studies in the Economics of Transportation.Yale University Press, New Haven, Conn., 1956.
4.
BrownstoneD. and SmallK. A.Valuing Time and Reliability: Assessing the Evidence from Road Pricing Demonstrations. Transportation Research, Part A, Vol. 39, 2005, pp. 279–293.
5.
SmallK. A. and YanJ.The Value of “Value Pricing” of Roads: Second-Best Pricing and Product Differentiation. Journal of Urban Economics, Vol. 49, 2001, pp. 310–336.
6.
SmallK. A.WinstonC. and YanJ.Uncovering the Distribution of Motorists’ Preferences for Travel Time and Reliability. Econometrica, Vol. 73, 2005, pp. 1367–1382.
7.
YangH. and HuangH. J.The Multi-Class, Multi-Criteria Traffic Network Equilibrium and System Optimum Problem. Transportation Research, Part B, Vol. 28, 2004, pp. 1–15.
8.
DafermosS. C.The Traffic Assignment Problem for Multi-Class User Transportation Networks. Transportation Science, Vol. 6, 1973, pp. 73–87.
9.
EngelsonL. and LindbergP. O.Congestion Pricing of Road Networks with Users Having Different Time Values. In Mathematical and Computational Models for Congestion Charging (LawphongpanichS.HearnD. W. and SmithM. J., eds.), Springer, New York, 2006, pp. 81–104.
10.
NagurneyA.A Multiclass, Multicriteria Traffic Network Equilibrium Model. Mathematical and Computer Modeling, Vol. 32, 2000, pp. 393–411.
11.
YinY. and YangH.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.
MayetJ. and HansenM.Congestion Pricing with Continuously Distributed Values of Time. Journal of Transport Economics and Policy, Vol. 34, 2000, pp. 359–370.
13.
ScheelH. and ScholtesS.Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity. Mathematics of Operations Research, Vol. 22, No. 12000, pp. 1–22.
14.
AhujaR. K.MaganantiT. L. and OrlinJ. B.Network Flows: Theory, Algorithms, and Applications.Prentice Hall, Englewood Cliffs, N.J., 1993.
15.
YangH. and ZhangX.Multiclass Network Toll Design Problem with Social and Spatial Equity Constraints. Journal of Transportation Engineering, Vol. 128, 2002, pp. 420–428.
16.
JahnO.MöhringR. H.SchulzA. S.Stier-MosesN. E.System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion. Operations Research, Vol. 53, 2005, pp. 600–616.
17.
FiskC. S.Game Theory and Transportation Systems Modeling. Transportation Research, Part B, Vol. 18, 1984, pp. 301–313.
18.
PoundstoneW.Prisoner's Dilemma.Doubleday, New York, 1992.
19.
HagstromJ. N. and AbramsR. 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.
HeranD. W. and RamanaM. V.Solving Congestion Toll Pricing Models. In Equilibrium and Advanced Transportation Modeling (MarcooteP. and NguyenS., eds.), Kluwer Academic Publishers, Norwell, Mass., 1998, pp. 109–124.
21.
ChenY. and FlorianM.The Nonlinear Bi-Level Programming Problem: Formulations, Regularity and Optimality Conditions. Optimization, Vol. 32, 1995, pp. 183–209.
22.
BaiL.HearnD. W. and LawphongpanichS.Decomposition Techniques for the Minimum Toll Revenue Problem. Networks, Vol. 14, No. 22004, pp. 142–150.
23.
FlorianM.GuélatJ. and SpiessH.An Efficient Implementation of the PARTAN Variant of the Linear Approximation Method for the Network Equilibrium Problem. Networks, Vol. 17, 1987, pp. 319–339.
