IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v43y2009i3p267-284.html
   My bibliography  Save this article

On the morning commute problem in a corridor network with multiple bottlenecks: Its system-optimal traffic flow patterns and the realizing tolling scheme

Author

Listed:
  • Shen, Wei
  • Zhang, H.M.

Abstract

There have been numerous studies of the morning commute problem in a network with a single route or parallel routes with a single bottleneck on each route. Most congested networks, however, often contain more than one congestion spot along each route. In such networks, it is usually difficult to derive analytically their system-optimal traffic patterns and the tolls that realize them. In this paper, we study the morning commute problem in such a network with certain special topological features - a freeway with multiple entry/exit ramps and a surface street grid with large capacities. For this type of networks, we investigated the basic characteristics of their optimal dynamic traffic patterns and the corresponding tolling scheme, for which a graphical solution procedure was also developed. In this network, we found that at system-optimum: (1) the aggregate traffic flow on the freeway has a staircase temporal profile, and piecewise linear dynamic tolls can be imposed on a subset of ramps to achieve it; (2) among all the off-ramps in use, the ones closer to the destination are being tolled longer with higher maximum toll charges than the ones farther away from the destination; and (3) among all the on-ramps in use, the ones with larger cumulative volume-to-capacity ratios are being tolled longer with higher maximum toll charges. Some practical implications of these findings to corridor traffic management were also discussed.

Suggested Citation

  • Shen, Wei & Zhang, H.M., 2009. "On the morning commute problem in a corridor network with multiple bottlenecks: Its system-optimal traffic flow patterns and the realizing tolling scheme," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 267-284, March.
    • Handle: RePEc:eee:transb:v:43:y:2009:i:3:p:267-284
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(08)00084-2
    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. Gordon F. Newell, 1987. "The Morning Commute for Nonidentical Travelers," Transportation Science, INFORMS, vol. 21(2), pages 74-88, May.
    2. Deepak K. Merchant & George L. Nemhauser, 1978. "Optimality Conditions for a Dynamic Traffic Assignment Model," Transportation Science, INFORMS, vol. 12(3), pages 200-207, August.
    3. Richard Arnott & André de Palma & Robin Lindsey, 1993. "Properties of Dynamic Traffic Equilibrium Involving Bottlenecks, Including a Paradox and Metering," Transportation Science, INFORMS, vol. 27(2), pages 148-160, May.
    4. Wie, Byung-Wook & Tobin, Roger L., 1998. "Dynamic congestion pricing models for general traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(5), pages 313-327, June.
    5. 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.
    6. Chris Hendrickson & George Kocur, 1981. "Schedule Delay and Departure Time Decisions in a Deterministic Model," Transportation Science, INFORMS, vol. 15(1), pages 62-77, February.
    7. Daganzo, Carlos F., 1995. "The cell transmission model, part II: Network traffic," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 79-93, April.
    8. Masao Kuwahara, 1990. "Equilibrium Queueing Patterns at a Two-Tandem Bottleneck during the Morning Peak," Transportation Science, INFORMS, vol. 24(3), pages 217-229, August.
    9. Vickrey, William S, 1969. "Congestion Theory and Transport Investment," American Economic Review, American Economic Association, vol. 59(2), pages 251-260, May.
    10. Muñoz, Juan Carlos & Laval, Jorge A., 2006. "System optimum dynamic traffic assignment graphical solution method for a congested freeway and one destination," Transportation Research Part B: Methodological, Elsevier, vol. 40(1), pages 1-15, January.
    11. Yang, Hai & Meng, Qiang, 1998. "Departure time, route choice and congestion toll in a queuing network with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 32(4), pages 247-260, May.
    12. Athanasios K. Ziliaskopoulos, 2000. "A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem," Transportation Science, INFORMS, vol. 34(1), pages 37-49, February.
    13. MERCHANT, Deepak K. & NEMHAUSER, George L., 1978. "A model and an algorithm for the dynamic traffic assignment problems," LIDAM Reprints CORE 346, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. Yang, Hai & Huang, Hai-Jun, 1998. "Principle of marginal-cost pricing: how does it work in a general road network?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(1), pages 45-54, January.
    15. Daganzo, Carlos F., 1994. "The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory," Transportation Research Part B: Methodological, Elsevier, vol. 28(4), pages 269-287, August.
    16. Ghali, M. O. & Smith, M. J., 1995. "A model for the dynamic system optimum traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(3), pages 155-170, June.
    17. Malachy Carey & Ashok Srinivasan, 1993. "Externalities, Average and Marginal Costs, and Tolls on Congested Networks with Time-Varying Flows," Operations Research, INFORMS, vol. 41(1), pages 217-231, February.
    18. Deepak K. Merchant & George L. Nemhauser, 1978. "A Model and an Algorithm for the Dynamic Traffic Assignment Problems," Transportation Science, INFORMS, vol. 12(3), pages 183-199, August.
    19. MERCHANT, Deepak K. & NEMHAUSER, George L., 1978. "Optimality conditions for a dynamic traffic assignment model," LIDAM Reprints CORE 345, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nie, Yu (Marco), 2011. "A cell-based Merchant-Nemhauser model for the system optimum dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(2), pages 329-342, February.
    2. Lu, Chung-Cheng & Liu, Jiangtao & Qu, Yunchao & Peeta, Srinivas & Rouphail, Nagui M. & Zhou, Xuesong, 2016. "Eco-system optimal time-dependent flow assignment in a congested network," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 217-239.
    3. Satsukawa, Koki & Wada, Kentaro & Watling, David, 2022. "Dynamic system optimal traffic assignment with atomic users: Convergence and stability," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 188-209.
    4. Bao, Yue & Verhoef, Erik T. & Koster, Paul, 2021. "Leaving the tub: The nature and dynamics of hypercongestion in a bathtub model with a restricted downstream exit," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    5. Fu, Haoran & Akamatsu, Takashi & Satsukawa, Koki & Wada, Kentaro, 2022. "Dynamic traffic assignment in a corridor network: Optimum versus equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 218-246.
    6. Osawa, Minoru & Fu, Haoran & Akamatsu, Takashi, 2018. "First-best dynamic assignment of commuters with endogenous heterogeneities in a corridor network," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 811-831.
    7. Cortina, Mélanie & Chiabaut, Nicolas & Leclercq, Ludovic, 2023. "Fostering synergy between transit and Autonomous Mobility-on-Demand systems: A dynamic modeling approach for the morning commute problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 170(C).
    8. Gonzales, Eric J., 2016. "Demand responsive transit systems with time-dependent demand: User equilibrium, system optimum, and management strategyAuthor-Name: Amirgholy, Mahyar," Transportation Research Part B: Methodological, Elsevier, vol. 92(PB), pages 234-252.
    9. Pi, Xidong & Qian, Zhen (Sean), 2017. "A stochastic optimal control approach for real-time traffic routing considering demand uncertainties and travelers’ choice heterogeneity," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 710-732.
    10. Shen, Wei & Zhang, H.M., 2014. "System optimal dynamic traffic assignment: Properties and solution procedures in the case of a many-to-one network," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 1-17.
    11. Zhao, Chuan-Lin & Leclercq, Ludovic, 2018. "Graphical solution for system optimum dynamic traffic assignment with day-based incentive routing strategies," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 87-100.
    12. 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.

    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. Shen, Wei & Zhang, H. Michael, 2009. "On the Morning Commute Problem in a Corridor Network with Multiple Bottlenecks: Its System-optimal Traffic Flow Patterns and the Realizing Tolling Scheme," Institute of Transportation Studies, Working Paper Series qt9bs815sq, Institute of Transportation Studies, UC Davis.
    2. Zhang, Pinchao & Qian, Sean, 2020. "Path-based system optimal dynamic traffic assignment: A subgradient approach," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 41-63.
    3. Nie, Yu (Marco), 2011. "A cell-based Merchant-Nemhauser model for the system optimum dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(2), pages 329-342, February.
    4. Satsukawa, Koki & Wada, Kentaro & Watling, David, 2022. "Dynamic system optimal traffic assignment with atomic users: Convergence and stability," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 188-209.
    5. Long, Jiancheng & Wang, Chao & Szeto, W.Y., 2018. "Dynamic system optimum simultaneous route and departure time choice problems: Intersection-movement-based formulations and comparisons," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 166-206.
    6. Lu, Gongyuan & Nie, Yu(Marco) & Liu, Xiaobo & Li, Denghui, 2019. "Trajectory-based traffic management inside an autonomous vehicle zone," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 76-98.
    7. Shen, Wei & Zhang, H.M., 2014. "System optimal dynamic traffic assignment: Properties and solution procedures in the case of a many-to-one network," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 1-17.
    8. Zhao, Chuan-Lin & Leclercq, Ludovic, 2018. "Graphical solution for system optimum dynamic traffic assignment with day-based incentive routing strategies," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 87-100.
    9. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    10. Zhu, Feng & Ukkusuri, Satish V., 2017. "Efficient and fair system states in dynamic transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 272-289.
    11. Long, Jiancheng & Szeto, W.Y. & Gao, Ziyou & Huang, Hai-Jun & Shi, Qin, 2016. "The nonlinear equation system approach to solving dynamic user optimal simultaneous route and departure time choice problems," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 179-206.
    12. Islam, Tarikul & Vu, Hai L. & Hoang, Nam H. & Cricenti, Antonio, 2018. "A linear bus rapid transit with transit signal priority formulation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 163-184.
    13. Carey, Malachy, 2021. "The cell transmission model with free-flow speeds varying over time or space," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 245-257.
    14. Shen, Wei & Zhang, H.M., 2010. "Pareto-improving ramp metering strategies for reducing congestion in the morning commute," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(9), pages 676-696, November.
    15. S. Waller & Athanasios Ziliaskopoulos, 2006. "A Combinatorial user optimal dynamic traffic assignment algorithm," Annals of Operations Research, Springer, vol. 144(1), pages 249-261, April.
    16. Lu, Chung-Cheng & Liu, Jiangtao & Qu, Yunchao & Peeta, Srinivas & Rouphail, Nagui M. & Zhou, Xuesong, 2016. "Eco-system optimal time-dependent flow assignment in a congested network," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 217-239.
    17. Small, Kenneth A., 2015. "The bottleneck model: An assessment and interpretation," Economics of Transportation, Elsevier, vol. 4(1), pages 110-117.
    18. Tong, C. O. & Wong, S. C., 2000. "A predictive dynamic traffic assignment model in congested capacity-constrained road networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 625-644, November.
    19. Ma, Rui & Ban, Xuegang (Jeff) & Pang, Jong-Shi, 2014. "Continuous-time dynamic system optimum for single-destination traffic networks with queue spillbacks," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 98-122.
    20. Ben-Tal, Aharon & Chung, Byung Do & Mandala, Supreet Reddy & Yao, Tao, 2011. "Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1177-1189, September.

    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:transb:v:43:y:2009:i:3:p:267-284. 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/548/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.