The Braess's Paradox in Dynamic Traffic

被引:1
|
作者
Zhuang, Dingyi [1 ]
Huang, Yuzhu [1 ]
Jayawardana, Vindula [2 ,3 ]
Zhao, Jinhua [1 ]
Suo, Dajiang [2 ,4 ]
Wu, Cathy [1 ,2 ]
机构
[1] MIT, Dept Civil & Environm Engn, Cambridge, MA 02139 USA
[2] MIT, Lab Informat & Decis Syst, Cambridge, MA 02139 USA
[3] MIT, Dept Elect Engn & Comp Sci, Cambridge, MA 02139 USA
[4] MIT, Dept Mech Engn, Cambridge, MA 02139 USA
关键词
MODEL;
D O I
10.1109/ITSC55140.2022.9921998
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Braess's Paradox (BP) is the observation that adding one or more roads to the existing road network will counter-intuitively increase traffic congestion and slow down the overall traffic flow. Previously, the existence of the BP is modeled using the static traffic assignment model, which solves for the user equilibrium subject to network flow conservation to find the equilibrium state and distributes all vehicles instantaneously. Such approach neglects the dynamic nature of real-world traffic, including vehicle behaviors and the interaction between vehicles and the infrastructure. As such, this article proposes a dynamic traffic network model and empirically validates the existence of the BP under dynamic traffic. In particular, we use microsimulation environment to study the impacts of an added path on a 2-by-3 all stop-controlled grid network. We explore how the network flow, vehicle travel time, and network capacity respond, as well as when the BP will occur. We find that adding a path to the network does not increase the overall network output flow and worsens it when the added path is more attractive. We observe that traffic flow on the added path increases first, but decreases after the demand level reaches an inflection point. The added path worsens the average travel time of all vehicles and does not provide additional operational capacity to the network.
引用
收藏
页码:1018 / 1023
页数:6
相关论文
共 50 条
  • [1] Characterizing Braess's Paradox for traffic networks
    Hagstrom, JN
    Abrams, RA
    [J]. 2001 IEEE INTELLIGENT TRANSPORTATION SYSTEMS - PROCEEDINGS, 2001, : 836 - 841
  • [2] The Analysis of Braess' Paradox and Robustness Based on Dynamic Traffic Assignment Models
    Fu, Bai-Bai
    Zhao, Chun-Xue
    Li, Shu-bin
    [J]. DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2013, 2013
  • [3] Dynamic Traffic Network Model and Time-Dependent Braess' Paradox
    Zhao, Chunxue
    [J]. DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2014, 2014
  • [4] Dynamic Braess's Paradox in Complex Communication Networks
    Xia, Yongxiang
    Hill, David J.
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2013, 60 (03) : 172 - 176
  • [5] Braess' paradox in a generalised traffic network
    Zverovich, Vadim
    Avineri, Erel
    [J]. JOURNAL OF ADVANCED TRANSPORTATION, 2015, 49 (01) : 114 - 138
  • [6] Braess' paradox in the age of traffic information
    Bittihn, S.
    Schadschneider, A.
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2021, 2021 (03):
  • [7] The effect of modern traffic information on Braess' paradox
    Bittihn, Stefan
    Schadschneider, Andreas
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2021, 571
  • [8] The Braess paradox in mechanical, traffic, and other networks
    Penchina, CM
    Penchina, LJ
    [J]. AMERICAN JOURNAL OF PHYSICS, 2003, 71 (05) : 479 - 482
  • [9] Braess's paradox in expanders
    Chung, Fan
    Young, Stephen J.
    Zhao, Wenbo
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2012, 41 (04) : 451 - 468
  • [10] A Braess's Paradox Inspired Method for Enhancing the Robustness of Air Traffic Networks
    Cai, Qing
    Alam, Sameer
    Ang, Haojie
    Duong, Vu
    [J]. 2020 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2020, : 798 - 805