Travel Times in Quasi-Dynamic Traffic Assignment

Research output: Contribution to conferencePosterScientific

46 Downloads (Pure)

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.
Original languageEnglish
Number of pages2
Publication statusPublished - 6 Sep 2019
EventSymposium of the European Association for Research in Transportation - Budapest Univesity of Technology and Economics, Budapest, Hungary
Duration: 4 Sep 20196 Sep 2019
Conference number: 8
http://heart2019.bme.hu/

Conference

ConferenceSymposium of the European Association for Research in Transportation
Abbreviated titlehEART
CountryHungary
CityBudapest
Period4/09/196/09/19
Internet address

Fingerprint

Dive into the research topics of 'Travel Times in Quasi-Dynamic Traffic Assignment'. Together they form a unique fingerprint.

Cite this