Linear Programming Formulation for Strategic Dynamic Traffic Assignment
Research output: Contribution to journal › Research article › Contributed › peer-review
Contributors
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 language | English |
---|---|
Pages (from-to) | 427-443 |
Number of pages | 17 |
Journal | Networks and Spatial Economics |
Volume | 13 |
Issue number | 4 |
Publication status | Published - Dec 2013 |
Peer-reviewed | Yes |
Externally published | Yes |
External IDs
ORCID | /0000-0002-2939-2090/work/141543894 |
---|
Keywords
ASJC Scopus subject areas
Keywords
- Demand uncertainty, Dynamic traffic assignment, Linear programming