Abstract In this chapter is devoted to user equilibrium and system optimum of Wardrop. Discussion on the mathematical formulation of traffic assignment problems with regard to their meaning is available in the Sect. 2.1. The specification of necessary basic statements completes this discussion further. The dual traffic assignment problem with travel times between all origins and destinations as dual variables is considered in the Sect. 2.2. The practical significance of such dual formulation is shown to become evident due to the wide spread of online traffic services. The route-flow assignment problem and link-flow assignment problem are reduced to fixed-point problems with explicit operators in the Sect. 2.3 and Sect. 2.4 respectively. Proofs of corresponding theorems are fully given.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Principles of Wardrop for Traffic Assignment in a Road Network


    Contributors:


    Publication date :

    2019-11-27


    Size :

    27 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Estimating urban traffic states using iterative refinement and Wardrop equilibria

    Li, Weizi / Jiang, Meilei / Chen, Yaoyu et al. | IET | 2018

    Free access

    Estimating urban traffic states using iterative refinement and Wardrop equilibria

    Li, Weizi / Jiang, Meilei / Chen, Yaoyu et al. | Wiley | 2018

    Free access

    Traffic assignment to road network

    Almond, J. | Engineering Index Backfile | 1965


    Alec Peachey talks to Eurovia's Scott Wardrop

    British Library Online Contents | 2014


    Wardrop Equilibria with Risk-Averse Users

    Laval, Jorge A. | Online Contents | 2010