 Properties of system optimal traffic assignment with departure time choice and its solution methodAndy H.F. Chow Transportation Research Part B: Methodological, 2009, vol. 43, issue 3, 325-344 Abstract: This paper investigates dynamic system optimal traffic assignment with departure time choice and its solution method. Dynamic system optimal assignment is formulated as a state-dependent optimal control problem. A fixed volume of traffic is assigned to departure times and routes such that the total system travel cost is minimized. We derive and discuss the necessary conditions on the network inflow for operating the transportation system optimally. We further provide detailed mathematical analysis and discussion of dynamic system optimal assignment when the deterministic queuing model is adopted. Solution algorithm is developed and investigated for solving the traffic assignments. The effect of choosing the underlying traffic model and time discretization on the quality of the corresponding assignment results are also discussed. This paper contributes to the literature on dynamic traffic modelling and management, and to support further analysis and model development in this area. Keywords: Dynamic; system; optimum; Departure; time; choice; Dynamic; road; pricing; Travel; time; models; Bottleneck; model (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:43:y:2009:i:3:p:325-344 Ordering information: This journal article can be ordered from Access Statistics for this article Transportation Research Part B: Methodological is currently edited by Fred Mannering More articles in Transportation Research Part B: Methodological from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.