Travel demand matrix estimation for strategic road traffic assignment models with strict capacity constraints and residual queues

Journal Article (2023)
Author(s)

Luuk J N Brederode (DAT.Mobility, TU Delft - Transport and Planning)

A. J. Pel (TU Delft - Transport and Planning)

L.J.J. Wismans (DAT.Mobility, University of Twente)

Bernike Rijksen (University of Twente)

S.P. Hoogendoorn (TU Delft - Transport and Planning)

Transport and Planning
Copyright
© 2023 L.J.N. Brederode, A.J. Pel, Luc Wismans, Bernike Rijksen, S.P. Hoogendoorn
DOI related publication
https://doi.org/10.1016/j.trb.2022.11.006
More Info
expand_more
Publication Year
2023
Language
English
Copyright
© 2023 L.J.N. Brederode, A.J. Pel, Luc Wismans, Bernike Rijksen, S.P. Hoogendoorn
Transport and Planning
Volume number
167
Pages (from-to)
1-31
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

This paper presents an efficient solution method for the matrix estimation problem using a static capacity constrained traffic assignment (SCCTA) model with residual queues. The solution method allows for inclusion of route queuing delays and congestion patterns besides the traditional link flows and prior demand matrix whilst the tractability of the SCCTA model avoids the need for tedious tuning of application specific algorithmic parameters. The proposed solution method solves a series of simplified optimization problems, thereby avoiding costly additional assignment model runs. Link state constraints are used to prevent usage of approximations outside their valid range as well as to include observed congestion patterns. The proposed solution method is designed to be fast, scalable, robust, tractable and reliable because conditions under which a solution to the simplified optimization problem exist are known and because the problem is convex and has a smooth objective function. Four test case applications on the small Sioux Falls model are presented, each consisting of 100 runs with varied input for robustness. The applications demonstrate the added value of inclusion of observed congestion patterns and route queuing delays within the solution method. In addition, application on the large scale BBMB model demonstrates that the proposed solution method is indeed scalable to large scale applications and clearly outperforms the method mostly used in current practice.