Optimal queue placement in dynamic system optimum solutions for single origin-destination traffic networks

The Dynamic System Optimum (DSO) traffic assignment problem aims to determine a time-dependent routing pattern of travellers in a network such that the given time-dependent origin-destination demands are satisfied and the total travel time is at a minimum, assuming some model for dynamic network loading. The network kinematic wave model is now widely accepted as such a model, given its realism in reproducing phenomena such as transient queues and spillback to upstream links. An attractive solution strategy for DSO based on such a model is to reformulate as a set of side constraints apply a standard solver, and to this end two methods have been previously proposed, one based on the discretisation scheme known as the Cell Transmission Model (CTM), and the other based on the Link Transmission Model (LTM) derived from variational theory. In the present paper we aim to combine the advantages of CTM (in tracking time-dependent congestion formation within a link) with those of LTM (avoiding cell discretisation, providing a more computationally attractive with much fewer constraints). The motivation for our work is the previously-reported possibility for DSO to have multiple solutions, which differ in where queues are formed and dissipated in the network. Our aim is to find DSO solutions that optimally distribute the congestion over links inside the network which essentially eliminate avoidable queue spillbacks. In order to do so, we require more information than the LTM can offer, but wish to avoid the computational burden of CTM for DSO. We thus adopt an extension of the LTM called the Two-regime Transmission Model (TTM), which is consistent with LTM at link entries and exits but which is additionally able to accurately track the spatial and temporal formation of the congestion boundary within a link (which we later show to be a critical element, relative to LTM). We set out the theoretical background necessary for the formulation of the network-level TTM as a set of linear side constraints. Numerical experiments are used to illustrate the application of the method to determine DSO solutions avoiding spillbacks, reduce/eliminate the congestion and to show the distinctive elements of adopting TTM over LTM. Furthermore, in comparison to a fine-level CTM-based DSO method, our formulation is seen to significantly reduce the number of linear constraints while maintaining a reasonable accuracy.

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

[2]  Malachy Carey,et al.  Dynamic traffic assignment approximating the kinematic wave model: System optimum, marginal costs, externalities and tolls , 2012 .

[3]  Dirk Cattrysse,et al.  A generic class of first order node models for dynamic macroscopic simulation of traffic flows , 2011 .

[4]  Hillel Bar-Gera,et al.  Continuous and Discrete Trajectory Models for Dynamic Traffic Assignment , 2005 .

[5]  Lorenzo Meschini,et al.  Spillback congestion in dynamic traffic assignment: A macroscopic flow model with time-varying bottlenecks , 2007 .

[6]  Dong Ngoduy,et al.  The two-regime transmission model for network loading in dynamic traffic assignment problems , 2014 .

[7]  Lorenzo Meschini,et al.  Macroscopic arc performance models with capacity constraints for within-day dynamic traffic assignment , 2005 .

[8]  Lanshan Han,et al.  Dynamic user equilibrium with a path based cell transmission model for general traffic networks , 2012 .

[9]  Jong-Shi Pang,et al.  Continuous-time dynamic system optimum for single-destination traffic networks with queue spillbacks , 2014 .

[10]  Jean-Pierre Aubin,et al.  Dirichlet problems for some Hamilton-Jacobi equations with inequality constraints , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[11]  Gunnar Flötteröd,et al.  Operational macroscopic modeling of complex urban road intersections , 2011 .

[12]  Athanasios K. Ziliaskopoulos,et al.  Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future , 2001 .

[13]  Jong-Shi Pang,et al.  Continuous-Time Dynamic System Optimal for Single-Destination (DSO) Traffic Networks Considering Queue Spillbacks , 2013 .

[14]  Steven Logghe,et al.  Multicommodity Link Transmission Model for Dynamic Network Loading , 2006 .

[15]  L. Evans,et al.  Partial Differential Equations , 1941 .

[16]  Jean-Pierre Aubin,et al.  Viability Theory: New Directions , 2011 .

[17]  Carlos F. Daganzo,et al.  THE CELL TRANSMISSION MODEL, PART II: NETWORK TRAFFIC , 1995 .

[18]  Alexandre M. Bayen,et al.  Lax–Hopf Based Incorporation of Internal Boundary Conditions Into Hamilton-Jacobi Equation. Part II: Computational Methods , 2010, IEEE Transactions on Automatic Control.

[19]  C. Daganzo.  A variational formulation of kinematic waves: basic theory and complex boundary conditions , 2005 .

[20]  Dong Ngoduy.  Multiclass first-order modelling of traffic networks using discontinuous flow-density relationships , 2010 .

[21]  P. I. Richards.  Shock Waves on the Highway , 1956 .

[22]  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 .

[23]  S. Travis Waller,et al.  A Decomposition Scheme for System Optimal Dynamic Traffic Assignment Models , 2003 .

[24]  H. M. Zhang,et al.  A Comparative Study of Some Macroscopic Link Models Used in Dynamic Traffic Assignment , 2005 .

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

[26]  Gordon F. Newell,et al.  A SIMPLIFIED THEORY OF KINEMATIC WAVES , 1991 .

[27]  Jean-Pierre Aubin,et al.  Dirichlet Problems for some Hamilton--Jacobi Equations with Inequality Constraints , 2008, SIAM J. Control. Optim..

[28]  W. Y. Szeto,et al.  Continuous-time link-based kinematic wave model: formulation, solution existence, and well-posedness , 2012, 1208.5141.

[29]  W. Y. Szeto,et al.  A cell-based variational inequality formulation of the dynamic user optimal assignment problem , 2002 .

[30]  W. Y. Szeto,et al.  A Cell‐Based Model for Multi‐class Doubly Stochastic Dynamic Traffic Assignment , 2011, Comput. Aided Civ. Infrastructure Eng..

[31]  Malachy Carey,et al.  Comparison of Methods for Path Flow Reassignment for Dynamic User Equilibrium , 2011, Networks and Spatial Economics.

[32]  C. Daganzo.  THE CELL TRANSMISSION MODEL.. , 1994 .

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

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

[35]  Jong-Shi Pang,et al.  Modeling and solving continuous-time instantaneous dynamic user equilibria: A differential complementarity systems approach , 2012 .

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

[37]  Wen-Long Jin,et al.  Continuous formulations and analytical properties of the link transmission model , 2014, 1405.7080.

[38]  Satish V. Ukkusuri,et al.  Linear Programming Models for the User and System Optimal Dynamic Network Design Problem: Formulations, Comparisons and Extensions , 2008 .

[39]  M J Lighthill,et al.  On kinematic waves II. A theory of traffic flow on long crowded roads , 1955, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[40]  Serge P. Hoogendoorn,et al.  Modeling Traffic Flow Operation in Multilane and Multiclass Urban Networks , 2005 .

[41]  Athanasios K. Ziliaskopoulos,et al.  System Optimal Signal Optimization Formulation , 2006 .

[42]  S. P. Hoogendoorn,et al.  Modeling Traffic Flow Operation in Multilane and Multiclass Urban Networks , 2005 .

[43]  G. F. Newell.  A simplified theory of kinematic waves in highway traffic, part I: General theory , 1993 .

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

[45]  Adam J. Pel,et al.  A family of macroscopic node models , 2015 .

[46]  W. Y. Szeto,et al.  DYNAMIC TRAFFIC ASSIGNMENT: PROPERTIES AND EXTENSIONS , 2006 .

[47]  Carlos F. Daganzo,et al.  On the variational theory of traffic flow: well-posedness, duality and applications , 2006, Networks Heterog. Media.