By extending static traffic assignment with explicit capacity constraints, quasi-dynamic traffic assignment yields more realistic results while avoiding many disadvantages of a dynamic assignment. We analyse the computation of travel times in quasi-dynamic assignment models. We formulate and check requirements for the correctness of resulting travel times, addressing both the calculation of travel times for individual routes and links itself, as well as the differences between travel times of different travel choices. We demonstrate that existing approaches for travel time computation in the literature fail to satisfy all requirements and derive a new link travel time formula from the vertical queuing theory that does meet all requirements. We discuss expected changes to assignment results and methodological advantages for pathfinding and model extensions, including horizontal queuing. The new link travel time formulation is finally applied to three example scenarios from literature.


    Access

    Download


    Export, share and cite



    Title :

    Travel times in quasi-dynamic traffic assignment


    Contributors:

    Published in:

    Publication date :

    2020-01-01


    Size :

    27 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    Analytical Dynamic Traffic Assignment Model with Probabilistic Travel Times and Perceptions

    Liu, Henry X. / Ban, Xuegang / Ran, Bin et al. | Transportation Research Record | 2002


    Analytical Dynamic Traffic Assignment Model with Probabilistic Travel Times and Perceptions

    Liu, H. X. / Ban, X. / Ran, B. et al. | British Library Conference Proceedings | 2002


    Travel Times Computation for Dynamic Assignment Modelling

    Buisson, C. / Lebacque, J. P. / Lesort, J. B. et al. | British Library Conference Proceedings | 1998


    Quasi-Continuous Dynamic Traffic Assignment Model

    Janson, Bruce N. | Online Contents | 1995