A Network Flow Algorithm for the Cell-Based Single-Destination System Optimal Dynamic Traffic Assignment Problem
Hong Zheng () and
Yi-Chang Chiu ()
Additional contact information
Hong Zheng: Department of Civil Engineering and Engineering Mechanics, University of Arizona, Tucson, Arizona 85721
Yi-Chang Chiu: Department of Civil Engineering and Engineering Mechanics, University of Arizona, Tucson, Arizona 85721
Transportation Science, 2011, vol. 45, issue 1, 121-137
Abstract:
The cell-transmission model-based single-destination system optimal dynamic traffic assignment problem proposed by Ziliaskopoulos was mostly solved by standard linear programming (LP) methods, e.g., simplex and interior point methods, which produce link-based flows involving vehicle-holding phenomenon. In this paper we present a network flow algorithm for this problem. We show that the problem is equivalent to the earliest arrival flow and then solve the earliest arrival flow on a time-expanded network. In particular, a scaled flow scheme is proposed to deal with the situation in which the ratio of backward wave speed to forward wave speed is less than one. The proposed algorithm produces path-based flows exhibiting realistic nonvehicle-holding properties. Complexity and numerical analyses show that the algorithm runs more efficiently than LP.
Keywords: dynamic traffic assignment; network flows; system optimal; cell-transmission model; vehicle-holding (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (20)
Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1100.0343 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:45:y:2011:i:1:p:121-137
Access Statistics for this article
More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().