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

On the uniqueness of equilibrated dynamic traffic flow patterns in unidirectional networks

Author

Listed:
  • Iryo, Takamasa
  • Smith, Michael J.

Abstract

Uniqueness of the dynamic user-equilibrium assignment is still an important issue. This paper proves uniqueness with a milder condition compared to past studies and shows another counterexample to the uniqueness. A unidirectional network, in which any node on any shortest route has a unique node potential, is introduced. Orders of vehicles are determined by this node potential so that, given any two vehicles passing through the same node, the lower potential vehicle arrives at the node before the higher potential vehicle. It is shown that, for a unidirectional network in equilibrium, the link travel times and traffic volumes of congested links are uniquely determined. Moreover, a simple non-unidirectional network having multiple equilibria is introduced. This example exhibits importance of unidirectional-network structure to prove uniqueness.

Suggested Citation

  • Iryo, Takamasa & Smith, Michael J., 2018. "On the uniqueness of equilibrated dynamic traffic flow patterns in unidirectional networks," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 757-773.
    • Handle: RePEc:eee:transb:v:117:y:2018:i:pb:p:757-773
    DOI: 10.1016/j.trb.2017.09.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261517307701
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2017.09.009?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. Huang, Hai-Jun & Lam, William H. K., 2002. "Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues," Transportation Research Part B: Methodological, Elsevier, vol. 36(3), pages 253-273, March.
    2. Friesz, Terry L. & Mookherjee, Reetabrata, 2006. "Solving the dynamic network user equilibrium problem with state-dependent time shifts," Transportation Research Part B: Methodological, Elsevier, vol. 40(3), pages 207-229, March.
    3. Iryo, Takamasa, 2011. "Multiple equilibria in a dynamic traffic network," Transportation Research Part B: Methodological, Elsevier, vol. 45(6), pages 867-879, July.
    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. Mounce, Richard, 2006. "Convergence in a continuous dynamic queueing model for traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 40(9), pages 779-791, November.
    6. Georgia Perakis & Guillaume Roels, 2006. "An Analytical Model for Traffic Delays and the Dynamic User Equilibrium Problem," Operations Research, INFORMS, vol. 54(6), pages 1151-1171, December.
    7. Friesz, Terry L. & Kim, Taeil & Kwon, Changhyun & Rigdon, Matthew A., 2011. "Approximate network loading and dual-time-scale dynamic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 176-207, January.
    8. Han, Ke & Friesz, Terry L. & Szeto, W.Y. & Liu, Hongcheng, 2015. "Elastic demand dynamic network user equilibrium: Formulation, existence and computation," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 183-209.
    9. Takashi Akamatsu, 2001. "An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues," Transportation Science, INFORMS, vol. 35(4), pages 389-404, November.
    10. Takamasa Iryo, 2015. "Investigating Factors for Existence of Multiple Equilibria in Dynamic Traffic Network," Networks and Spatial Economics, Springer, vol. 15(3), pages 599-616, September.
    11. Akamatsu, Takashi, 2000. "A dynamic traffic equilibrium assignment paradox," Transportation Research Part B: Methodological, Elsevier, vol. 34(6), pages 515-531, August.
    12. Takamasa Iryo, 2010. "On the Existence of Pure Nash Equilibrium in Dynamic Traffic Assignments," Chapters, in: Chris M.J. Tampere & Francesco Viti & Lambertus H. (Ben) Immers (ed.), New Developments in Transport Planning, chapter 4, Edward Elgar Publishing.
    13. 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.
    14. Lo, Hong K. & Szeto, W. Y., 2002. "A cell-based variational inequality formulation of the dynamic user optimal assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 36(5), pages 421-443, June.
    15. Takashi Akamatsu & Benjamin Heydecker, 2003. "Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks," Transportation Science, INFORMS, vol. 37(2), pages 123-138, May.
    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. Satsukawa, Koki & Wada, Kentaro & Iryo, Takamasa, 2020. "Reprint of “Stochastic stability of dynamic user equilibrium in unidirectional networks: Weakly acyclic game approach”," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 117-135.
    2. Satsukawa, Koki & Wada, Kentaro & Iryo, Takamasa, 2019. "Stochastic stability of dynamic user equilibrium in unidirectional networks: Weakly acyclic game approach," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 229-247.

    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. Ke Han & Gabriel Eve & Terry L. Friesz, 2019. "Computing Dynamic User Equilibria on Large-Scale Networks with Software Implementation," Networks and Spatial Economics, Springer, vol. 19(3), pages 869-902, September.
    2. Friesz, Terry L. & Han, Ke & Bagherzadeh, Amir, 2021. "Convergence of fixed-point algorithms for elastic demand dynamic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 336-352.
    3. Han, Ke & Friesz, Terry L. & Szeto, W.Y. & Liu, Hongcheng, 2015. "Elastic demand dynamic network user equilibrium: Formulation, existence and computation," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 183-209.
    4. Song, Wenjing & Han, Ke & Wang, Yiou & Friesz, Terry L. & del Castillo, Enrique, 2018. "Statistical metamodeling of dynamic network loading," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 740-756.
    5. Friesz, Terry L. & Han, Ke, 2019. "The mathematical foundations of dynamic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 309-328.
    6. Iryo, Takamasa, 2011. "Multiple equilibria in a dynamic traffic network," Transportation Research Part B: Methodological, Elsevier, vol. 45(6), pages 867-879, July.
    7. 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.
    8. Rui Ma & Xuegang (Jeff) Ban & Jong-Shi Pang, 2018. "A Link-Based Differential Complementarity System Formulation for Continuous-Time Dynamic User Equilibria with Queue Spillbacks," Transportation Science, INFORMS, vol. 52(3), pages 564-592, June.
    9. 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.
    10. Ban, Xuegang (Jeff) & Liu, Henry X. & Ferris, Michael C. & Ran, Bin, 2008. "A link-node complementarity model and solution algorithm for dynamic user equilibria with exact flow propagations," Transportation Research Part B: Methodological, Elsevier, vol. 42(9), pages 823-842, November.
    11. Han, Ke & Szeto, W.Y. & Friesz, Terry L., 2015. "Formulation, existence, and computation of boundedly rational dynamic user equilibrium with fixed or endogenous user tolerance," Transportation Research Part B: Methodological, Elsevier, vol. 79(C), pages 16-49.
    12. Ren-Yong Guo & Hai Yang & Hai-Jun Huang, 2018. "Are We Really Solving the Dynamic Traffic Equilibrium Problem with a Departure Time Choice?," Transportation Science, INFORMS, vol. 52(3), pages 603-620, June.
    13. Zhong, R.X. & Sumalee, A. & Friesz, T.L. & Lam, William H.K., 2011. "Dynamic user equilibrium with side constraints for a traffic network: Theoretical development and numerical solution algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1035-1061, August.
    14. Friesz, Terry L. & Kim, Taeil & Kwon, Changhyun & Rigdon, Matthew A., 2011. "Approximate network loading and dual-time-scale dynamic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 176-207, January.
    15. Satsukawa, Koki & Wada, Kentaro & Iryo, Takamasa, 2020. "Reprint of “Stochastic stability of dynamic user equilibrium in unidirectional networks: Weakly acyclic game approach”," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 117-135.
    16. Iryo, Takamasa & Smith, Michael J. & Watling, David, 2020. "Stabilisation strategy for unstable transport systems under general evolutionary dynamics," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 136-151.
    17. Satsukawa, Koki & Wada, Kentaro & Iryo, Takamasa, 2019. "Stochastic stability of dynamic user equilibrium in unidirectional networks: Weakly acyclic game approach," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 229-247.
    18. Hoang, Nam H. & Vu, Hai L. & Panda, Manoj & Lo, Hong K., 2019. "A linear framework for dynamic user equilibrium traffic assignment in a single origin-destination capacitated network," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 329-352.
    19. Qixiu Cheng & Zhiyuan Liu & Feifei Liu & Ruo Jia, 2017. "Urban dynamic congestion pricing: an overview and emerging research needs," International Journal of Urban Sciences, Taylor & Francis Journals, vol. 21(0), pages 3-18, August.
    20. 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.

    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:117:y:2018:i:pb:p:757-773. 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.