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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    On incremental methods for traffic assignment


    Beteiligte:

    Erscheinungsdatum :

    1974-08-19


    Format / Umfang :

    3 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Incremental equilibrium assignment and applications to traffic network model

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

    Freier Zugriff

    Incremental equilibrium assignment and applications to traffic network model

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

    Freier Zugriff

    BISOS: Backwards Incremental System Optimum Search algorithm for fast socially optimal traffic assignment

    Ivanchev, Jordan / Zehe, Daniel / Viswanathan, Vaisagh et al. | IEEE | 2016


    Traffic assignment

    Engineering Index Backfile | 1952


    Traffic assignment techniques

    Thomas, Roy | SLUB | 1991