DocumentCode
3463912
Title
Characterizing Braess´s paradox for traffic networks
Author
Hagstrom, J.N. ; Abrams, R.A.
Author_Institution
Dept. of Inf. & Decision Sci., Illinois Univ., Chicago, IL, USA
fYear
2001
fDate
2001
Firstpage
836
Lastpage
841
Abstract
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
Keywords
nonlinear programming; road traffic; transportation; Braess paradox; Pareto optimal; multiple commodity traffic; noncooperative equilibrium; nonlinear programming; road traffic; traffic flows; transportation; Cost function; Mathematical programming; Nash equilibrium; Telecommunication traffic; Testing; Time measurement; Transportation;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Transportation Systems, 2001. Proceedings. 2001 IEEE
Conference_Location
Oakland, CA
Print_ISBN
0-7803-7194-1
Type
conf
DOI
10.1109/ITSC.2001.948769
Filename
948769
Link To Document