A Network Flow Algorithm for the Cell-Based Single-Destination System Optimal Dynamic Traffic Assignment Problem

摘要: The cell-transmission model-based single-destination system optimal dynamic traffic assignment problem proposed by Ziliaskopoulos was mostly solved standard linear programming (LP) methods, e.g., simplex and interior point which produce link-based flows involving vehicle-holding phenomenon. In this paper we present a network flow algorithm for problem. We show that the is equivalent to earliest arrival then solve on time-expanded network. particular, scaled scheme deal with situation in ratio of backward wave speed forward less than one. produces path-based exhibiting realistic nonvehicle-holding properties. Complexity numerical analyses runs more efficiently LP.