It is shown that any traffic assignment by shortest path method based on time alone is out of balance because procedure always assigns too many trips to high-speed facility and too few trips to slow-speed facility; method is presented of assigning weights to time and to distance in factor to bring about necessary balance in assignment; proportion of time and distance which assigned same volumes to freeway (or bypass) as measured volumes also gave average speed of network close to weighted average measured speed of network.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Traffic assignment by shortest path method using TD factor


    Weitere Titelangaben:

    Traffic Quarterly


    Beteiligte:
    Benesh, A.H. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1967


    Format / Umfang :

    15 pages


    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch


    Schlagwörter :




    Evaluation of Shortest Path Algorithms in a Distributed Traffic Assignment Environment

    Kriesten, R. / Kiencke, U. / Society of Automotive Engineers | British Library Conference Proceedings | 2003


    Evaluation of Shortest Path Algorithms in a Distributed Traffic Assignment Environment

    Kriesten, Reiner / Kiencke, Uwe | SAE Technical Papers | 2003


    Evaluation of shortest path algorithms in a distributed traffic assignment environment

    Kriesten,R. / Kiencke,U. / Univ.Karlsruhe,DE | Kraftfahrwesen | 2003