Travel Times in Quasi-Dynamic Traffic Assignment
JPT van der Gun (TU Delft - Transport and Planning)
Adam Pel (TU Delft - Transport and Planning)
Bart Van Arem (TU Delft - Transport and Planning)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
By extending static traffic assignment with explicit capacity constraints, quasidynamic traffic assignment yields more realistic results while avoiding many disadvantages of 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 literature fail to satisfy all requirements and derive a new link travel time formula from 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.