We generalize Braess's (1968) paradoxical example by defining a Braess paradox to occur when the Wardrop equilibrium distribution of traffic flows is not strongly Pareto optimal. We characterize a Braess paradox in terms of the solution to a mathematical program. Examples illustrate unexpected properties of these solutions. We discuss a computational approach to detecting a Braess paradox.
Characterizing Braess's paradox for traffic networks
2001-01-01
579024 byte
Conference paper
Electronic Resource
English
Characterizing Braess's Paradox for Traffic Networks
British Library Conference Proceedings | 2001
|Braess's paradox of traffic flow
Elsevier | 1970
|The Braess's Paradox in Dynamic Traffic
IEEE | 2022
|Queue Spillback in Braess's Paradox Considering Dynamic Traffic Assignment
Trans Tech Publications | 2013
|Braess’s Paradox in Day-to-Day Model
Trans Tech Publications | 2014
|