Improving the Convergence of Simulation-based Dynamic Traffic Assignment Methodologies

Research output: Contribution to journalResearch articleContributedpeer-review

Contributors

  • Michael W. Levin - , University of Texas at Austin (Author)
  • Matt Pool - , University of Texas at Austin (Author)
  • Travis Owens - , University of Texas at Austin (Author)
  • Natalia Ruiz Juri - , University of Texas at Austin (Author)
  • S. Travis Waller - , University of New South Wales (Author)

Abstract

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.

Details

Original languageEnglish
Pages (from-to)655-676
Number of pages22
JournalNetworks and Spatial Economics
Volume15
Issue number3
Publication statusPublished - 1 Sept 2015
Peer-reviewedYes
Externally publishedYes

External IDs

ORCID /0000-0002-2939-2090/work/141543892

Keywords

Keywords

  • Based, Column generation, Convergence, Dynamic traffic assignment, Gradient, Gradient projection, Heuristics, MSA, Simplicial decomposition, Simulation, Stability