Time-Based Toll Design for a Cordon-Based Congestion Pricing Scheme for a Transportation Network with Speed Limits and Movement Prohibitions
This article has been corrected.
VIEW CORRECTIONPublication: Journal of Transportation Engineering
Volume 140, Issue 6
Abstract
In the central business district (CBD) of metropolises, speed limits and movement prohibitions are often imposed on roads and intersections, respectively, for the purpose of safety and congestion mitigation and sometimes also to attempt to cut down vehicular aggregations and emissions. Based on this kind of general transportation network, this paper investigates the optimal time-based toll design problem for a cordon-based congestion pricing scheme in which toll charges are determined according to time consumed by travelers in traversing a predetermined cordon. Under the common hypothesis of travelers following the deterministic user equilibrium principle, this practical time-based toll design problem is formulated as a mathematical programming with equilibrium constraint (MPEC) model and solved by the Hooke-Jeeves algorithm, a derivative-free pattern search method. Taking into account the movement prohibitions at intersections, this paper presents a shortest-path model with movement prohibitions and develops an efficient branch and bound algorithm. Subsequently, the deterministic user equilibrium model can be solved by combining the proposed branch and bound algorithm with the method of successive averages (MSA). Finally, a medium-sized network example is adopted to numerically validate the proposed models and algorithms, and different features and results of four kinds of toll design schemes are further analyzed and discussed.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgments
We wish to express our thanks to the editors and two anonymous reviewers, whose constructive comments and suggestions have improved the earlier versions of this paper. The first reviewer offered us much technological guidance to enrich the contents of the paper. We also thank the second reviewer, who offered us Fig. 1 to illustrate the counterexample. The research is supported by the National Natural Science Foundation of China (Grant No. 71231007). Any shortcomings in the paper are our responsibility.
References
Buckingham, C., Doherty, A. R., Hawkett, D., and Vitouladiti, S. (2010). “Central London congestion charging: Understanding its impacts.” Transport, 163(2), 73–83.
Chandra, C., Liu, Z., He, J., and Ruohonen, T. (2014). “A binary branch and bound algorithm to minimize maximum scheduling cost.” Omega, 42(1), 9–15.
Chen, A., Ryu, S., Xu, X., and Choi, K. (2014). “Computation and application of the paired combinatorial logit stochastic user equilibrium problem.” Comput. Oper. Res., 43, 68–77.
Chiou, S. W. (2011). “A novel algorithm for area traffic capacity control with elastic travel demands.” Appl. Math. Model, 35(2), 650–666.
de Palma, A., and Lindsey, R. (2011). “Traffic congestion pricing methodologies and technologies.” Transp. Res. Part C, 19(6), 1377–1399.
Easa, S. M. (1985). “Shortest-route algorithm with movement prohibitions.” Transp. Res. Part B, 19(3), 197–208.
Eliasson, J. (2009). “A cost-benefit analysis of the Stockholm congestion charging system.” Transp. Res. Part A, 43(4), 468–480.
Geoffrion, A. M., and Marsten, R. E. (1972). “Integer programming algorithms: A framework and state-of-the-art survey.” Manage. Sci., 18(9), 465–491.
Goerigk, M., Grun, B., and HeBler, P. (2013). “Branch and bound algorithms for the bus evacuation problem.” Comput. Oper. Res., 40(12), 3010–3020.
Hadiuzzaman, M., Qiu, T. Z., and Lu, X. Y. (2013). “Variable speed limit control design for relieving congestion caused by active bottlenecks.” J. Transp. Eng., 358–370.
Li, C., Yang, H., Zhu, D., and Meng, Q. (2012). “A global optimization method for continuous network design problems.” Transp. Res. Part B, 46(9), 1144–1158.
Liu, H. X., He, X. Z., and He, B. S. (2009). “Method of successive weighted averages (MSWA) and self-regulated averaging schemes for solving stochastic user equilibrium problem.” Network Spatial Econ., 9(4), 485–503.
Liu, Z. Y., Meng, Q., and Wang, S. A. (2013). “Speed-based toll design for cordon-based congestion pricing scheme.” Transp. Res. Part C, 31(SI), 83–98.
Lu, C. C., and Mahmassani, H. S. (2011). “Modeling heterogeneous network user route and departure time responses to dynamic pricing.” Transp. Res. Part C, 19(2SI), 320–337.
May, A. D., and Milne, D. S. (2000). “Effects of alternative road pricing systems on network performance.” Transp. Res. Part A, 34(6), 407–436.
Meng, Q., and Liu, Z. Y. (2012). “Impact analysis of cordon-based congestion pricing on mode-split for a bimodal transportation network.” Transp. Res. Part C, 21(1), 134–147.
Meng, Q., Liu, Z. Y., and Wang, S. A. (2012). “Optimal distance tolls under congestion pricing and continuously distributed value of time.” Transp. Res. Part E, 48(5SI), 937–957.
Meng, Q., and Yang, H. (2002). “Benefit distribution and equality in road network design.” Transp. Res. Part B, 36(1), 19–35.
Ohazulike, A. E., Still, G., Kern, W., and van Berkum, E. C. (2013). “An origin-destination based road pricing model for static and multi-period traffic assignment problems.” Transp. Res. Part E, 58, 1–27.
Rios, L. M., and Sahinidis, N. V. (2013). “Derivative-free optimization: A review of algorithms and comparison of software implementations.” J. Global Optim., 56(3SI), 1247–1293.
Rouillon, S., Desaulniers, G., and Soumis, F. (2006). “An extended branch-and-bound method for locomotive assignment.” Transp. Res. Part B, 40(5), 404–423.
Tam, M. L., and Lam, W. H. K. (1999). “Analysis of demand for road-based transport facilities: A bi-level programming approach.” Transp. Res. Rec. J. Transp. Res. Board, 1685(1), 73–80.
Tsekeris, T., and Voβ, S. (2009). “Design and evaluation of road pricing: State-of-the-art and methodological advances.” Netnomics, 10(1), 5–52.
Wang, S. A. (2013). “Efficiency and equity of speed limits in transportation networks.” Transp. Res. Part C, 32(SI), 61–75.
Yang, H., and Huang, H. (2005). Mathematical and economic theory of road pricing, Elsevier, Oxford.
Yang, H., Wang, X. L., and Yin, Y. F. (2012). “The impact of speed limits on traffic equilibrium and system performance in networks.” Transp. Res. Part B, 46(10), 1295–1307.
Yang, H., and Zhang, X. N. (2002). “Multiclass network toll design problem with social and spatial equity constraints.” J. Transp. Eng., 420–428.
Zhang, K. L., Mahmassani, H. S., and Lu, C. C. (2013). “Dynamic pricing, heterogeneous users and perception error: Probit-based bi-criterion dynamic stochastic user equilibrium assignment.” Transp. Res. Part C, 27(SI), 189–204.
Zhang, X. N., and Yang, H. (2004). “The optimal cordon-based network congestion pricing problem.” Transp. Res. Part B, 38(6), 517–537.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 140 • Issue 6 • June 2014
Copyright
© 2014 American Society of Civil Engineers.
History
Received: Nov 18, 2013
Accepted: Jan 6, 2014
Published online: Mar 20, 2014
Published in print: Jun 1, 2014
Discussion open until: Aug 20, 2014
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.