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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Traffic assignment by shortest path method using TD factor


    Additional title:

    Traffic Quarterly


    Contributors:

    Published in:

    Publication date :

    1967


    Size :

    15 pages


    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    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 | Automotive engineering | 2003



    Evaluation of Shortest Path Algorithms in a Distributed Traffic Assignment Environment

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


    Based on Transcad of the Shortest Path Assignment Method

    Li, Qing Yin ;Tang, Rui ;Tan, Zhang Lu | Trans Tech Publications | 2011