This paper proposes reliability-based system-optimal traffic assignment under supply uncertainty based on the concept of the total system travel time budget, and defines the price of anarchy (PoA) for the corresponding user equilibrium (UE) traffic assignment. An analytical formula for a set of the upper bounds of the PoA for the equilibrium assignment to the networks with polynomial link travel time functions is derived. These bounds are proved to be independent of the network topology and demands. The formula for the minimum upper bound is also derived and can be reduced to the upper bound formula for traditional UE traffic assignment as a special case. The PoA for the traditional UE network design problem (NDP) with polynomial link travel time functions is defined, and proved to be bounded by the upper bound of that for traditional UE traffic assignment of the same instance, before any link expansion. The PoA for the reliability-based UE (RUE) NDP with polynomial link travel time functions is also proved to be bounded by the set of upper bounds of that for RUE traffic assignment of the same instance, before any link expansion.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Price of anarchy for reliability-based traffic assignment and network design


    Contributors:
    Szeto, W.Y. (author) / Wang, Anny B. (author)

    Published in:

    Publication date :

    2015-08-09


    Size :

    33 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    A microsimulation based analysis of the price of anarchy in traffic routing: The enhanced Braess network case

    Belov, Aleksandr / Mattas, Konstantinos / Makridis, Michail et al. | Taylor & Francis Verlag | 2022


    Numerical Bounds on the Price of Anarchy

    Louis de Grange / Carlos Melo-Riquelme / Cristóbal Burgos et al. | DOAJ | 2017

    Free access

    The price of anarchy in truckload transportation spot markets

    Michael Haughton / Borzou Rostami / Shervin Espahbod | DOAJ | 2022

    Free access

    Network Traffic Assignment

    Friesz, Terry L. / Bernstein, David | Springer Verlag | 2016


    Network Design Effects of Dynamic Traffic Assignment

    Janson, Bruce N. | Online Contents | 1995