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: Contribution to conference › Poster › Scientific

69 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 language	English
Number of pages	2
Publication status	Published - 6 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/

Access to Document

PosterFinal published version, 8.43 MB

1 Conference contribution

Travel times in quasi-dynamic traffic assignment
van der Gun, J., Pel, A. & van Arem, B., 11 Sept 2019, hEART 2019: Budapest. 11 p. 74
Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

Open Access
File

Cite this

@conference{0bbfa3450f6b4f6e9b004e267d4ecb8c,

title = "Travel Times in Quasi-Dynamic Traffic Assignment",

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

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

year = "2019",

month = sep,

day = "6",

language = "English",

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

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

}

TY - CONF

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/6

Y1 - 2019/9/6

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

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

M3 - Poster

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

Access to Document

Fingerprint

Research output

Travel times in quasi-dynamic traffic assignment

Cite this