Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Characterizing Braess's paradox for traffic networks
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
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
Hagstrom, J.N. (Autor:in) / Abrams, R.A. (Autor:in)
01.01.2001
579024 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Characterizing Braess's Paradox for Traffic Networks
British Library Conference Proceedings | 2001
|Queue Spillback in Braess's Paradox Considering Dynamic Traffic Assignment
British Library Conference Proceedings | 2013
|Utility, entropy and a “paradox” of traffic flow
Elsevier | 1979
|