Back to Search
Start Over
On the System Optimum Dynamic Traffic Assignment and Earliest Arrival Flow Problems.
- Source :
- Transportation Science; Feb2015, Vol. 49 Issue 1, p13-27, 15p
- Publication Year :
- 2015
-
Abstract
- This paper investigates the cell-transmission model (CTM)-based single destination system optimum dynamic traffic assignment (SO-DTA) problem, focusing attention on a case where the cell properties are time-invariant. We show the backward propagation of congestion in CTM does not affect the optimal arrival flow pattern of SO-DTA, if the fundamental diagram is of triangular/trapezoidal shape as in the CTM. We mathematically prove that the set of earliest arrival flows (EAFs) not constrained by the traffic wave propagation equations obtained on the node-arc network without cell division is a subset of the SO-DTA. This finding leads to a new approach to the SO-DTA that solves the EAF. Such an EAF can be obtained by merely applying static flow techniques and turning the static flows into dynamic flows over time. Therefore, SO-DTA can theoretically be solved with a run time at the link level depending polynomially on log T . We use numerical examples to verify the results and report the computational benefits of the proposed method by solving SO-DTA on a real-world network. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00411655
- Volume :
- 49
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Transportation Science
- Publication Type :
- Academic Journal
- Accession number :
- 111059595
- Full Text :
- https://doi.org/10.1287/trsc.2013.0485