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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Characterizing Braess's paradox for traffic networks


    Contributors:


    Publication date :

    2001-01-01


    Size :

    579024 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Characterizing Braess's Paradox for Traffic Networks

    Hagstrom, J. N. / Abrams, R. A. / IEEE | British Library Conference Proceedings | 2001


    Braess's paradox of traffic flow

    Murchland, J.D. | Elsevier | 1970


    The Braess's Paradox in Dynamic Traffic

    Zhuang, Dingyi / Huang, Yuzhu / Jayawardana, Vindula et al. | IEEE | 2022


    Queue Spillback in Braess's Paradox Considering Dynamic Traffic Assignment

    Wei, He ;Dai, Ji Feng | Trans Tech Publications | 2013


    Braess’s Paradox in Day-to-Day Model

    Li, Qi | Trans Tech Publications | 2014