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

Quasi-dynamic traffic assignment with spatial queueing, control and blocking back

Author

Listed:
  • Smith, Mike
  • Huang, Wei
  • Viti, Francesco
  • Tampère, Chris M.J.
  • Lo, Hong K.

Abstract

This paper introduces a steady-state, fixed (or inelastic) demand equilibrium model with explicit link-exit capacities, explicit bottleneck or queueing delays and explicit bounds on queue storage capacities. The model is a quasi-dynamic model. The link model at the heart of this quasi-dynamic equilibrium model is a spatial queueing model, which takes account of the space taken up by queues both when there is no blocking back and also when there is blocking back. The paper shows that if this quasi-dynamic model is utilised then for any feasible demand there is an equilibrium solution, provided (i) queue storage capacities are large or (ii) prices are used to help impose capacity restrictions; the prices either remove queueing delays entirely or just reduce spatial queues sufficiently to ensure that blocking back does not occur at equilibrium. Similar results, but now involving the P0 control policy (introduced in Smith (1979a, 1987)) and two new variations of this policy (i.e., the spatial P0 control policy, and the biased spatial P0 control policy) are obtained. In these results, the control policies allow green-times to vary in response to prices as well as spatial queueing delays. These three policies are also tested on a small simple network. In these tests, the biased spatial version of P0 is much the best in reducing equilibrium delays (on this simple network). The paper further illustrates how the spatial queueing model works on simple networks with different merge models; it is demonstrated that equilibrium may be prevented by certain (fixed ratio) merge models. It is also shown in this case that equilibrium may be imposed on just the controlled area itself by a variety of (merge model, gating strategy) combinations. Opportunities for developing such combined gating and merging control strategies are finally discussed.

Suggested Citation

  • Smith, Mike & Huang, Wei & Viti, Francesco & Tampère, Chris M.J. & Lo, Hong K., 2019. "Quasi-dynamic traffic assignment with spatial queueing, control and blocking back," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 140-166.
    • Handle: RePEc:eee:transb:v:122:y:2019:i:c:p:140-166
    DOI: 10.1016/j.trb.2019.01.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261518302534
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2019.01.018?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Bliemer, Michiel C.J. & Raadsen, Mark P.H. & Smits, Erik-Sander & Zhou, Bojian & Bell, Michael G.H., 2014. "Quasi-dynamic traffic assignment with residual point queues incorporating a first order node model," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 363-384.
    2. Stella Dafermos, 1980. "Traffic Equilibrium and Variational Inequalities," Transportation Science, INFORMS, vol. 14(1), pages 42-54, February.
    3. A. de Palma & Y. Nesterov, 2001. "Stationary Dynamic Solutions in Congested Transportation Networks: Summary and Perspectives," THEMA Working Papers 2001-19, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    4. Smith, M. J., 1979. "The existence, uniqueness and stability of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 295-304, December.
    5. Larsson, Torbjörn & Patriksson, Michael, 1995. "An augmented lagrangean dual algorithm for link capacity side constrained traffic assignment problems," Transportation Research Part B: Methodological, Elsevier, vol. 29(6), pages 433-455, December.
    6. 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.
    7. Nie, Yu & Zhang, H. M. & Lee, Der-Horng, 2004. "Models and algorithms for the traffic assignment problem with link capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 38(4), pages 285-312, May.
    8. Bar-Gera, Hillel, 2010. "Traffic assignment by paired alternative segments," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1022-1046, September.
    9. Viti, Francesco & van Zuylen, Henk J., 2010. "Probabilistic models for queues at fixed control signals," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 120-135, January.
    10. Carlos F. Daganzo, 1998. "Queue Spillovers in Transportation Networks with a Route Choice," Transportation Science, INFORMS, vol. 32(1), pages 3-11, February.
    11. Tampère, Chris M.J. & Corthout, Ruben & Cattrysse, Dirk & Immers, Lambertus H., 2011. "A generic class of first order node models for dynamic macroscopic simulation of traffic flows," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 289-309, January.
    12. Smith, M.J. & Liu, R. & Mounce, R., 2015. "Traffic control and route choice: Capacity maximisation and stability," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 863-885.
    13. Gentile, Guido & Meschini, Lorenzo & Papola, Natale, 2007. "Spillback congestion in dynamic traffic assignment: A macroscopic flow model with time-varying bottlenecks," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1114-1138, December.
    14. Zhong, R.X. & Chen, C. & Huang, Y.P. & Sumalee, A. & Lam, W.H.K. & Xu, D.B., 2018. "Robust perimeter control for two urban regions with macroscopic fundamental diagrams: A control-Lyapunov function approach," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 687-707.
    15. Gentile, Guido & Meschini, Lorenzo & Papola, Natale, 2005. "Macroscopic arc performance models with capacity constraints for within-day dynamic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 39(4), pages 319-338, May.
    16. Hillel Bar-Gera, 2002. "Origin-Based Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 36(4), pages 398-417, November.
    17. He, Xiaozheng & Guo, Xiaolei & Liu, Henry X., 2010. "A link-based day-to-day traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 597-608, May.
    18. Jin, Wen-Long, 2010. "Continuous kinematic wave models of merging traffic flow," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1084-1103, September.
    19. Keyvan-Ekbatani, Mehdi & Kouvelas, Anastasios & Papamichail, Ioannis & Papageorgiou, Markos, 2012. "Exploiting the fundamental diagram of urban networks for feedback-based gating," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1393-1403.
    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. Raadsen, Mark P.H. & Bliemer, Michiel C.J., 2023. "General solution scheme for the static link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 169(C), pages 108-135.
    2. Yahyamozdarani, Raheleh & Tampère, Chris M.J., 2023. "The continuous signalized (COS) node model for dynamic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 56-80.

    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. Bliemer, Michiel C.J. & Raadsen, Mark P.H. & Smits, Erik-Sander & Zhou, Bojian & Bell, Michael G.H., 2014. "Quasi-dynamic traffic assignment with residual point queues incorporating a first order node model," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 363-384.
    2. Bliemer, Michiel C.J. & Raadsen, Mark P.H., 2020. "Static traffic assignment with residual queues and spillback," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 303-319.
    3. Raadsen, Mark P.H. & Bliemer, Michiel C.J., 2023. "General solution scheme for the static link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 169(C), pages 108-135.
    4. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    5. Ngoduy, D. & Hoang, N.H. & Vu, H.L. & Watling, D., 2016. "Optimal queue placement in dynamic system optimum solutions for single origin-destination traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 92(PB), pages 148-169.
    6. Wada, Kentaro & Satsukawa, Koki & Smith, Mike & Akamatsu, Takashi, 2019. "Network throughput under dynamic user equilibrium: Queue spillback, paradox and traffic control," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 391-413.
    7. Liu, Ronghui & Smith, Mike, 2015. "Route choice and traffic signal control: A study of the stability and instability of a new dynamical model of route choice and traffic signal control," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 123-145.
    8. Jin, Wen-Long, 2015. "Continuous formulations and analytical properties of the link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 74(C), pages 88-103.
    9. Lie Han, 2022. "Proportional-Switch Adjustment Process with Elastic Demand and Congestion Toll in the Absence of Demand Functions," Networks and Spatial Economics, Springer, vol. 22(4), pages 709-735, December.
    10. Gentile, Guido, 2016. "Solving a Dynamic User Equilibrium model based on splitting rates with Gradient Projection algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 92(PB), pages 120-147.
    11. Smith, Mike & Mounce, Richard, 2011. "A splitting rate model of traffic re-routeing and traffic control," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1389-1409.
    12. Jabari, Saif Eddin, 2016. "Node modeling for congested urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 229-249.
    13. 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).
    14. Flötteröd, Gunnar & Rohde, Jannis, 2011. "Operational macroscopic modeling of complex urban road intersections," Transportation Research Part B: Methodological, Elsevier, vol. 45(6), pages 903-922, July.
    15. Jiang, Chenming & Bhat, Chandra R. & Lam, William H.K., 2020. "A bibliometric overview of Transportation Research Part B: Methodological in the past forty years (1979–2019)," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 268-291.
    16. Lu, Chung-Cheng & Mahmassani, Hani S. & Zhou, Xuesong, 2009. "Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 345-364, March.
    17. Levin, Michael W. & Boyles, Stephen D. & Patel, Rahul, 2016. "Paradoxes of reservation-based intersection controls in traffic networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 90(C), pages 14-25.
    18. Wang, Yi & Szeto, W.Y. & Han, Ke & Friesz, Terry L., 2018. "Dynamic traffic assignment: A review of the methodological advances for environmentally sustainable road transportation applications," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 370-394.
    19. Wen-Long Jin, 2015. "Advances in Dynamic Traffic Assgmnt: TAC," Networks and Spatial Economics, Springer, vol. 15(3), pages 617-634, September.
    20. Smits, Erik-Sander & Bliemer, Michiel C.J. & Pel, Adam J. & van Arem, Bart, 2015. "A family of macroscopic node models," Transportation Research Part B: Methodological, Elsevier, vol. 74(C), pages 20-39.

    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:122:y:2019:i:c:p:140-166. 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.