Abstract The purpose of this note is a critical appraisal of incremental methods for traffic assignment. The main point which we develop is that incremental methods do not solve the minimization problem associated with computing an assignment that satisfies Wardrop's first extremal principle. We illustrate our conclusion with a simple counter example.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    On incremental methods for traffic assignment


    Contributors:

    Publication date :

    1974-08-19


    Size :

    3 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Incremental equilibrium assignment and applications to traffic network model

    Chao Sun / Haodong Jing / Taolüe Chen et al. | DOAJ | 2023

    Free access

    Incremental equilibrium assignment and applications to traffic network model

    Sun, Chao / Jing, Haodong / Chen, Taolüe et al. | Wiley | 2023

    Free access

    The Dilemma and Countermeasures of incremental assignment of network traffic flow

    chengxiang, D. | British Library Conference Proceedings | 2010


    The Dilemma and Countermeasures of incremental assignment of network traffic flow

    chengxiang, D. / yongxiu, W. | British Library Conference Proceedings | 2010


    Traffic assignment by Mechanical Methods

    Engineering Index Backfile | 1956