Linear Programming Formulation for Strategic Dynamic Traffic Assignment
Publikation: Beitrag in Fachzeitschrift › Forschungsartikel › Beigetragen › Begutachtung
Beitragende
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
Originalsprache | Englisch |
---|---|
Seiten (von - bis) | 427-443 |
Seitenumfang | 17 |
Fachzeitschrift | Networks and Spatial Economics |
Jahrgang | 13 |
Ausgabenummer | 4 |
Publikationsstatus | Veröffentlicht - Dez. 2013 |
Peer-Review-Status | Ja |
Extern publiziert | Ja |
Externe IDs
ORCID | /0000-0002-2939-2090/work/141543894 |
---|
Schlagworte
ASJC Scopus Sachgebiete
Schlagwörter
- Demand uncertainty, Dynamic traffic assignment, Linear programming