Travel times in quasi-dynamic traffic assignment

Research output: Contribution to journalArticleScientificpeer-review

51 Downloads (Pure)

Abstract

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.

Original languageEnglish
Pages (from-to)865-891
Number of pages27
JournalTransportmetrica A: Transport Science
Volume16
Issue number3
DOIs
Publication statusPublished - 2020

Keywords

  • capacity constraint
  • link performance function
  • link travel time
  • Quasi-dynamic traffic assignment
  • vertical queuing theory

Fingerprint Dive into the research topics of 'Travel times in quasi-dynamic traffic assignment'. Together they form a unique fingerprint.

Cite this