The Braess Paradox in Dynamic Traffic

  title={The Braess Paradox in Dynamic Traffic},
  author={Dingyi Zhuang and Yuzhu Huang and Vindula Jayawardana and Jinhuan Zhao and Dajiang Suo and Cathy Wu},
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… 

Figures from this paper


The Analysis of Braess’ Paradox and Robustness Based on Dynamic Traffic Assignment Models
The results show that Braess’ paradox only occurs in certain range; the robustness of the network and the relationship of total traffic costs are changed as the traffic demand changes, which provides theoretical guidance for the urban transportation planning.
A microsimulation based analysis of the price of anarchy in traffic routing: The enhanced Braess network case
This paper investigates the Price of Anarchy (PoA) over a Braess-like network using the most detailed way to model traffic—the microscopic simulation with parameters defining the driving behavior.
On the Microscopic Modeling of Vehicular Traffic on General Networks
A formalism to deal with the microscopic modeling of vehicular traffic on a road network and the emergence of Nash equilibria in a non-stationary situation results in the appearance of Braess type paradoxes.
Braess paradox in a network with stochastic dynamics and fixed strategies
In a noncongested transportation network where each user chooses the quickest route, the creation of an additional route between some origin-destination pair clearly cannot result in an increase in
Congested traffic states in empirical observations and microscopic simulations
  • Treiber, Hennecke, Helbing
  • Physics
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 2000
It is shown that the results of the microscopic model can be understood by formulating the theoretical phase diagram for bottlenecks in a more general way, and a local drop of the road capacity induced by parameter variations has essentially the same effect as an on-ramp.
A Dynamic Route Choice Model Considering Uncertain Capacities
This article extends the linear programming cell transmission model-based dynamic traffic assignment (LP CTM-DTA) model to account for travelers’ consideration of uncertainty regarding saturation flow rates, and presents results on the class of symmetric probability distributions that has been particularly popular in the robust optimization literature.
A Computational Model for the Probit-Based Dynamic Stochastic User Optimal Traffic Assignment Problem
The authors conclude that the Ishikawa algorithm has better accuracy for a smaller network despite requiring longer computational time.
Flow: A Modular Learning Framework for Mixed Autonomy Traffic
The suitability of deep reinforcement learning (RL) for overcoming challenges in a low AV-adoption regime is studied and a modular learning framework is presented, which leverages deep RL to address complex traffic dynamics.