This paper explores the network properties when queues spill over network links, by examining a paradox of network expansion. In networks, each commuter simultaneously chooses departure time and travel route to minimize the travel cost including journey time and unpunctuality penalty. Using some necessary conditions of dynamic user equilibrium the dynamic network flows are exactly obtained on some small networks. Then we use a network with two origins and two destinations to illustrate an interesting paradox that is caused by the FIFO behavior among commuters traveling on a common upstream link of which the exit is blocked by one branch of downstream traffic. The comparison analysis in this example shows that point-queue models often overestimate the network performance and consideration of queuing spatial dimension in dynamic traffic assignment is necessary.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A New Braess's Paradox with Queue Spillovers Considering Dynamic User Equilibrium


    Beteiligte:
    Zhang, Xiaoning (Autor:in) / Zhang, H. M. (Autor:in)

    Kongress:

    Seventh International Conference of Chinese Transportation Professionals Congress (ICCTP) ; 2007 ; Shanghai, China



    Erscheinungsdatum :

    2008-03-21




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    The Braess's Paradox in Dynamic Traffic

    Zhuang, Dingyi / Huang, Yuzhu / Jayawardana, Vindula et al. | IEEE | 2022


    Airway network management using Braess’s Paradox

    Ma, Chunyao / Cai, Qing / Alam, Sameer et al. | Elsevier | 2019


    Braess's paradox of traffic flow

    Murchland, J.D. | Elsevier | 1970


    Characterizing Braess's paradox for traffic networks

    Hagstrom, J.N. / Abrams, R.A. | IEEE | 2001


    Characterizing Braess's Paradox for Traffic Networks

    Hagstrom, J. N. / Abrams, R. A. / IEEE | British Library Conference Proceedings | 2001