Linear Programming Formulation for Strategic Dynamic Traffic Assignment

Research output: Contribution to journalResearch articleContributedpeer-review

Contributors

  • S. Travis Waller - , University of New South Wales, National ICT Australia (NICTA) (Author)
  • David Fajardo - , University of New South Wales (Author)
  • Melissa Duell - , University of New South Wales, National ICT Australia (NICTA) (Author)
  • Vinayak Dixit - , University of New South Wales (Author)

Abstract

This work introduces a novel formulation of system optimal dynamic traffic assignment that captures strategic route choice in users under demand uncertainty. We define strategic route choice to be that users choose a path prior to knowing the true travel demand which will be experienced (therefore users consider the full set of possible demand scenarios). The problem is formulated based on previous work by Ziliaskopoulos (Transp Sci 34(1):37-49, 2000). The resulting novel formulation requires substantial enhancement to account for path-based flows and scenario-based stochastic demands. Further, a numerical demonstration is presented on a network with different demand loading profiles. Finally, model complexity, implications on scalability and future research directions are discussed.

Details

Original languageEnglish
Pages (from-to)427-443
Number of pages17
JournalNetworks and Spatial Economics
Volume13
Issue number4
Publication statusPublished - Dec 2013
Peer-reviewedYes
Externally publishedYes

External IDs

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

Keywords

Keywords

  • Demand uncertainty, Dynamic traffic assignment, Linear programming