Improving the Convergence of Simulation-based Dynamic Traffic Assignment Methodologies

The ability of simulation-based dynamic traffic assignment (SBDTA) models to produce reliable solutions is crucial for practical applications, particularly for those involving the comparison of modeling results across multiple scenarios. This work reviews, implements and compares novel and existing...

Full description

Saved in:
Bibliographic Details
Published inNetworks and spatial economics Vol. 15; no. 3; pp. 655 - 676
Main Authors Levin, Michael W., Pool, Matt, Owens, Travis, Juri, Natalia Ruiz, Travis Waller, S.
Format Journal Article
LanguageEnglish
Published New York Springer US 01.09.2015
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1566-113X
1572-9427
DOI10.1007/s11067-014-9242-x

Cover

More Information
Summary:The ability of simulation-based dynamic traffic assignment (SBDTA) models to produce reliable solutions is crucial for practical applications, particularly for those involving the comparison of modeling results across multiple scenarios. This work reviews, implements and compares novel and existing techniques for finding equilibrium solutions for SBDTA problems, focusing on their convergence pattern and stability of the results. The considered methodologies, ranging from MSA and gradient-based heuristics to column generation frameworks and partial demand loading schemes, have not been previously compared side-to-side in the literature. This research uses a single SBDTA platform to conduct such comparison on three real networks, including one with more than 200,000 trips. Most analyzed approaches were found to require a similar number of simulation runs to reach near-equilibrium solutions. However, results suggest that the quality of the results for a given convergence level may vary across methodologies.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1566-113X
1572-9427
DOI:10.1007/s11067-014-9242-x