Travel times in quasi-dynamic traffic assignment

Jeroen van der Gun; Adam Pel; Bart van Arem

Travel times in quasi-dynamic traffic assignment

Jeroen van der Gun, Adam Pel, Bart van Arem

Transport and Planning

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

95 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 language	English
Title of host publication	hEART 2019
Subtitle of host publication	Budapest
Number of pages	11
Publication status	Published - 11 Sept 2019
Event	Symposium of the European Association for Research in Transportation - Budapest Univesity of Technology and Economics, Budapest, Hungary Duration: 4 Sept 2019 → 6 Sept 2019 Conference number: 8 http://heart2019.bme.hu/

Conference

Conference	Symposium of the European Association for Research in Transportation
Abbreviated title	hEART
Country/Territory	Hungary
City	Budapest
Period	4/09/19 → 6/09/19
Internet address	http://heart2019.bme.hu/

Bibliographical note

Accepted Author Manuscript

Keywords

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

Access to Document

hEART 2019 paper 74Accepted author manuscript, 445 KB

1 Poster

Travel Times in Quasi-Dynamic Traffic Assignment
van der Gun, J., Pel, A. & van Arem, B., 6 Sept 2019. 2 p.
Research output: Contribution to conference › Poster › Scientific

Open Access
File

Cite this

@inproceedings{4ace6f27123b4c99a33f6c8856dac83c,

title = "Travel times in quasi-dynamic traffic assignment",

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.",

keywords = "quasi-dynamic traffic assignment, link travel time, vertical queuing theory, capacity constraint, link performance function",

author = "{van der Gun}, Jeroen and Adam Pel and {van Arem}, Bart",

note = "Accepted Author Manuscript; Symposium of the European Association for Research in Transportation, hEART ; Conference date: 04-09-2019 Through 06-09-2019",

year = "2019",

month = sep,

day = "11",

language = "English",

booktitle = "hEART 2019",

url = "http://heart2019.bme.hu/",

}

TY - GEN

T1 - Travel times in quasi-dynamic traffic assignment

AU - van der Gun, Jeroen

AU - Pel, Adam

AU - van Arem, Bart

N1 - Conference code: 8

PY - 2019/9/11

Y1 - 2019/9/11

N2 - 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.

AB - 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.

KW - quasi-dynamic traffic assignment

KW - link travel time

KW - vertical queuing theory

KW - capacity constraint

KW - link performance function

M3 - Conference contribution

BT - hEART 2019

T2 - Symposium of the European Association for Research in Transportation

Y2 - 4 September 2019 through 6 September 2019

ER -

Travel times in quasi-dynamic traffic assignment

Abstract

Conference

Bibliographical note

Keywords

Access to Document

Fingerprint

Research output

Travel Times in Quasi-Dynamic Traffic Assignment

Cite this