IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v30y1996i5p319-332.html
   My bibliography  Save this article

Optimal road tolls under conditions of queueing and congestion

Author

Listed:
  • Yan, Hai
  • Lam, William H. K.

Abstract

Urban road networks in Hong Kong are highly congested, particularly during peak periods. Long vehicle queues at bottlenecks, such as the harbor tunnels, have become a daily occurrence. At present, tunnel tolls are charged in Hong Kong as one means to reduce traffic congestion. In general, flow pattern and queue length on a road network are highly dependent on traffic control and road pricing. An efficient control scheme must, therefore, take into account the effects of traffic control and road pricing on network flow. In this paper, we present a bi-level programming approach for determination of road toll pattern. The lower-level problem represents a queueing network equilibrium model that describes users' route choice behavior under conditions of both queueing and congestion. The upper-level problem is to determine road tolls to optimize a given system's performance while considering users' route choice behavior. Sensitivity analysis is also performed for the queueing network equilibrium problem to obtain the derivatives of equilibrium link flows with respect to link tolls. This derivative information is then applied to the evaluation of alternative road pricing policies and to the development of heuristic algorithms for the bi-level road pricing problem. The proposed model and algorithm are illustrated with numerical examples.

Suggested Citation

  • Yan, Hai & Lam, William H. K., 1996. "Optimal road tolls under conditions of queueing and congestion," Transportation Research Part A: Policy and Practice, Elsevier, vol. 30(5), pages 319-332, September.
    • Handle: RePEc:eee:transa:v:30:y:1996:i:5:p:319-332
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0965-8564(96)00003-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chaisak Suwansirikul & Terry L. Friesz & Roger L. Tobin, 1987. "Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem," Transportation Science, INFORMS, vol. 21(4), pages 254-263, November.
    2. Yang, Hai & Yagar, Sam & Iida, Yasunori & Asakura, Yasuo, 1994. "An algorithm for the inflow control problem on urban freeway networks with user-optimal flows," Transportation Research Part B: Methodological, Elsevier, vol. 28(2), pages 123-139, April.
    3. Smith, M. J., 1979. "The marginal cost taxation of a transportation network," Transportation Research Part B: Methodological, Elsevier, vol. 13(3), pages 237-242, September.
    4. Yang, Hai, 1995. "Heuristic algorithms for the bilevel origin-destination matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 231-242, August.
    5. Stella C. Dafermos, 1973. "Toll Patterns for Multiclass-User Transportation Networks," Transportation Science, INFORMS, vol. 7(3), pages 211-223, August.
    6. Arnott, R. & de Palma, A. & Lindsey, R., 1990. "Departure time and route choice for the morning commute," Transportation Research Part B: Methodological, Elsevier, vol. 24(3), pages 209-228, June.
    7. Yang, Hai & Yagar, Sam, 1995. "Traffic assignment and signal control in saturated road networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(2), pages 125-139, March.
    8. Laih, Chen-Hsiu, 1994. "Queueing at a bottleneck with single- and multi-step tolls," Transportation Research Part A: Policy and Practice, Elsevier, vol. 28(3), pages 197-208, May.
    9. Yang, Hai & Yagar, Sam, 1994. "Traffic assignment and traffic control in general freeway-arterial corridor systems," Transportation Research Part B: Methodological, Elsevier, vol. 28(6), pages 463-486, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Josefsson, Magnus & Patriksson, Michael, 2007. "Sensitivity analysis of separable traffic equilibrium equilibria with application to bilevel optimization in network design," Transportation Research Part B: Methodological, Elsevier, vol. 41(1), pages 4-31, January.
    2. Yang, Hai, 1997. "Sensitivity analysis for the elastic-demand network equilibrium problem with applications," Transportation Research Part B: Methodological, Elsevier, vol. 31(1), pages 55-70, February.
    3. Clegg, Janet & Smith, Mike & Xiang, Yanling & Yarrow, Robert, 2001. "Bilevel programming applied to optimising urban transportation," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 41-70, January.
    4. Li, Changmin & Yang, Hai & Zhu, Daoli & Meng, Qiang, 2012. "A global optimization method for continuous network design problems," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1144-1158.
    5. Yang, Hai, 1995. "Heuristic algorithms for the bilevel origin-destination matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 231-242, August.
    6. Maher, Michael J. & Zhang, Xiaoyan & Vliet, Dirck Van, 2001. "A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 23-40, January.
    7. Meng, Q. & Yang, H. & Bell, M. G. H., 2001. "An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 83-105, January.
    8. Ma, Rui & Ban, Xuegang (Jeff) & Szeto, W.Y., 2017. "Emission modeling and pricing on single-destination dynamic traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 255-283.
    9. Li, Qiaoru & Zhang, Zhe & Li, Kun & Chen, Liang & Wei, Zhenlin & Zhang, Jingchun, 2020. "Evolutionary dynamics of traveling behavior in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    10. Yao, Tao & Friesz, Terry L. & Wei, Mike Mingcheng & Yin, Yafeng, 2010. "Congestion derivatives for a traffic bottleneck," Transportation Research Part B: Methodological, Elsevier, vol. 44(10), pages 1149-1165, December.
    11. Lundgren, Jan T. & Peterson, Anders, 2008. "A heuristic for the bilevel origin-destination-matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 42(4), pages 339-354, May.
    12. Takayama, Yuki, 2018. "Time-varying congestion tolling and urban spatial structure," MPRA Paper 89896, University Library of Munich, Germany.
    13. Yang, Hai & Bell, Michael G. H., 2001. "Transport bilevel programming problems: recent methodological advances," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 1-4, January.
    14. Braid, Ralph M., 2018. "Partial peak-load pricing of a transportation bottleneck with homogeneous and heterogeneous values of time," Economics of Transportation, Elsevier, vol. 16(C), pages 29-41.
    15. Takayama, Yuki & Kuwahara, Masao, 2017. "Bottleneck congestion and residential location of heterogeneous commuters," Journal of Urban Economics, Elsevier, vol. 100(C), pages 65-79.
    16. S. Dempe & A. Zemkoho, 2012. "Bilevel road pricing: theoretical analysis and optimality conditions," Annals of Operations Research, Springer, vol. 196(1), pages 223-240, July.
    17. Bao, Yue & Xiao, Feng & Gao, Zaihan & Gao, Ziyou, 2017. "Investigation of the traffic congestion during public holiday and the impact of the toll-exemption policy," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 58-81.
    18. Ren-Yong Guo & Hai Yang & Hai-Jun Huang & Zhijia Tan, 2016. "Day-to-Day Flow Dynamics and Congestion Control," Transportation Science, INFORMS, vol. 50(3), pages 982-997, August.
    19. Zhaoqi Zang & Xiangdong Xu & Anthony Chen & Chao Yang, 2022. "Modeling the α-max capacity of transportation networks: a single-level mathematical programming formulation," Transportation, Springer, vol. 49(4), pages 1211-1243, August.
    20. Liu, Haoxiang & Wang, David Z.W., 2015. "Global optimization method for network design problem with stochastic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 20-39.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transa:v:30:y:1996:i:5:p:319-332. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.