Travel times in quasi-dynamic traffic assignment

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-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 dynamic assignment. We analyse the computation of travel times in quasi-dynamic assignment models. We formulate 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 derive a new link travel time formula from vertical queuing theory that meets all requirements, unlike existing approaches in literature.
Original languageEnglish
Title of host publicationhEART 2019
Subtitle of host publicationBudapest
Number of pages11
Publication statusPublished - 11 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

Bibliographical note

Accepted Author Manuscript

Keywords

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

Fingerprint

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

Cite this