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.
Travel times in quasi-dynamic traffic assignment
Transportmetrica A: Transport Science ; 16 , 3 ; 865-891
2020-01-01
27 pages
Article (Journal)
Electronic Resource
Unknown
Analytical Dynamic Traffic Assignment Model with Probabilistic Travel Times and Perceptions
Online Contents | 2002
|Analytical Dynamic Traffic Assignment Model with Probabilistic Travel Times and Perceptions
Transportation Research Record | 2002
|Analytical Dynamic Traffic Assignment Model with Probabilistic Travel Times and Perceptions
British Library Conference Proceedings | 2002
|Travel Times Computation for Dynamic Assignment Modelling
British Library Conference Proceedings | 1998
|Quasi-Continuous Dynamic Traffic Assignment Model
Online Contents | 1995
|