Space-Time Queues and Dynamic Traffic Assignment: A Model, Algorithm and Applications

Abstract

The evaluation of on-line intelligent transportation system (ITS) measures, such as adaptive route-guidance and traffic management systems, depends heavily on the use of faster than real time traffic simulation models. Off-line applications, such as the testing of ITS strategies and operational planning studies, are also best served by fast running traffic models due to the repetitive or iterative nature of such investigations. This paper describes a simulation-based iterative dynamic-equilibrium traffic assignment model. The determination of time-dependent path flows is modeled as a master problem that is solved using the method of successive averages (MSA). The determination of path travel times for a given set of path flows is the network-loading sub-problem, which is solved using the space- time queuing approach of Mahut. This loading method has been shown to provide reasonably accurate results with very little computational effort. The model was applied to two versions of the Stockholm road network: one consists of 2080 links, 1200 nodes and 220 zones representing over 5,000 turns; the other consists of 4342 links, 1980 nodes and 250 zones, representing over 11,000 turns. The results show that this model is applicable to medium-size networks with a very reasonable computation time

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 — 19 citations exist upstream.

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