Quasi-dynamic network loading: adding queuing and spillback to static traffic assignment

Abstract

For many years, static traffic assignment models have been widely applied in transport planning studies and will continue to be an important tool for strategic policy decisions. As is well known, in the traditional approach, the location of the delays and queues are not predicted correctly, and the resulting travel times do not correspond well with reality. Dynamic models can approach reality much better, but come at a computational cost. In this paper we propose a quasi-dynamic model which inherits most of the computational efficiency of static models, but aims to keep most of the important dynamic features, such as queuing, spillback, and shockwaves. Instead of adjusting the traditional static model or using heuristics, we theoretically derive the model from the dynamic link transmission model, assuming stationary travel demand and instantaneous flow. Furthermore, we present algorithms for solving the model. On a corridor network we illustrate the feasibility and compare it with other approaches, and on a larger network of Amsterdam we discuss the computational efficiency.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 12 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.