Continuous-time dynamic system optimum for single-destination traffic networks with queue spillbacks

Dynamic system optimum (DSO) is a special case of the general dynamic traffic assignment (DTA). It predicts the optimal traffic states of a network under time-dependent traffic conditions from the perspective of the entire system. An optimal control framework is proposed in this paper for the continuous-time DSO problem for single-destination traffic networks. Departure time choice is part of this DSO model. Double-queue model is applied to capture the impact of downstream congestion and possible queue spillbacks. Feasibility conditions and model properties are discussed. A constructive procedure to compute a free-flow DSO solution is also proposed. A discretization method is described to the continuous-time systems and numerical results on two test networks are shown.

[1]  Michel Bierlaire,et al.  Dynamic network loading: a stochastic differentiable model that derives link state distributions , 2011 .

[2]  Jorge A. Laval,et al.  System optimum dynamic traffic assignment graphical solution method for a congested freeway and one destination , 2006 .

[3]  Terry L. Friesz,et al.  Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem , 1989, Oper. Res..

[4]  Hong Zheng,et al.  A Network Flow Algorithm for the Cell-Based Single-Destination System Optimal Dynamic Traffic Assignment Problem , 2011, Transp. Sci..

[5]  Kai Zhang,et al.  Vehicle emissions in congestion: Comparison of work zone, rush hour and free-flow conditions , 2011 .

[6]  George L. Nemhauser,et al.  Optimality Conditions for a Dynamic Traffic Assignment Model , 1978 .

[7]  Athanasios K. Ziliaskopoulos,et al.  A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem , 2000, Transp. Sci..

[8]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[9]  Hai Yang,et al.  Modeling the capacity and level of service of urban transportation networks , 2000 .

[10]  Andy H.F. Chow.  Properties of system optimal traffic assignment with departure time choice and its solution method , 2009 .

[11]  O. Johansson,et al.  Optimal road-pricing: Simultaneous treatment of time losses, increased fuel consumption, and emissions , 1997 .

[12]  H. Michael Zhang,et al.  A Polymorphic Dynamic Network Loading Model , 2008, Comput. Aided Civ. Infrastructure Eng..

[13]  Wei Shen,et al.  System-optimal dynamic traffic assignment with and without queue spillback: Its path-based formulation and solution via approximate path marginal cost , 2012 .

[14]  Henry X. Liu,et al.  Model Reference Adaptive Control Framework for Real-Time Traffic Management Under Emergency Evacuation , 2007 .

[15]  Wei Shen,et al.  Dynamic Network Simplex Method for Designing Emergency Evacuation Plans , 2007 .

[16]  Wei Shen,et al.  System optimal dynamic traffic assignment: Properties and solution procedures in the case of a many-to-one network , 2014 .

[17]  Martin Skutella,et al.  Earliest Arrival Flows with Multiple Sources , 2009, Math. Oper. Res..

[18]  H. M. Zhang,et al.  Modelling network flow with and without link interactions: the cases of point queue, spatial queue and cell transmission model , 2013 .

[19]  Isaak Yperman,et al.  The Link Transmission Model for dynamic network loading , 2007 .

[20]  Yu Nie.  A Cell-based Merchant-Nemhauser Model for the System Optimum Dynamic Traffic Assignment Problem , 2010 .

[21]  Gunnar Flötteröd,et al.  Capturing Dependency Among Link Boundaries in a Stochastic Dynamic Network Loading Model , 2015, Transp. Sci..

[22]  H. M. Zhang,et al.  Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback , 2010 .

[23]  Wei Shen,et al.  What Do Different Traffic Flow Models Mean for System-Optimal Dynamic Traffic Assignment in a Many-to-One Network? , 2008 .