Travel Times in Quasi-Dynamic Traffic Assignment

Travel Times in Quasi-Dynamic Traffic Assignment

van der Gun, J.P.T. (TU Delft Transport and Planning)
Pel, A.J. (TU Delft Transport and Planning)
van Arem, B. (TU Delft Transport and Planning)

2019-09-06

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.

http://resolver.tudelft.nl/uuid:0bbfa345-0f6b-4f6e-9b00-4e267d4ecb8c

Symposium of the European Association for Research in Transportation, 2019-09-04 → 2019-09-06, Budapest Univesity of Technology and Economics, Budapest, Hungary

Institutional Repository

poster

© 2019 J.P.T. van der Gun, A.J. Pel, B. van Arem