Approximating Dynamic Equilibrium Conditions with Macroscopic Fundamental Diagrams

Real-time coordinated traffic management strategies that benefit from parsimonious models with aggregated network dynamics, provide a new generation of smart hierarchical strategies to improve network capacity and performance. However, this raises the question of route choice behavior in case of heterogeneous urban networks, where different parts of the city are subject to different types of control. Traffic equilibrium phenomena have not been thoroughly investigated in these models. In addition, approximate traffic equilibrium conditions can be integrated within the parsimonious traffic models to develop regional routing strategies. In this study, the authors develop an aggregated and approximate DTA procedure to be incorporated in the macroscopic fundamental diagram (MFD) dynamics, and establish dynamic user equilibrium (DUE) conditions. The methodology consists of two main components; stochastic network loading and a fixed-point solution method. Loading procedure is designed to handle stochastic components in the model such as trip length uncertainty, variation of speeds across the links, perception error of travelers. The results taken from this procedure are averaged through the well-known method of successive averages (MSA) to reach fixed-point solution for the system. Real-time route guidance strategies can be revisited towards a "system of systems" approach."

[1]  Markos Papageorgiou,et al.  Exploiting the fundamental diagram of urban networks for feedback-based gating , 2012 .

[2]  Bin Ran,et al.  A link-based variational inequality model for dynamic departure time/route choice , 1996 .

[3]  Antonio Sforza,et al.  ITERATIVE PROCEDURE FOR EQUILIBRIUM NETWORK TRAFFIC SIGNAL SETTING , 1991 .

[4]  Ludovic Leclercq,et al.  Macroscopic Fundamental Diagrams: A cross-comparison of estimation methods , 2014 .

[5]  M. Ben-Akiva,et al.  STOCHASTIC EQUILIBRIUM MODEL OF PEAK PERIOD TRAFFIC CONGESTION , 1983 .

[6]  Dirk Helbing,et al.  The spatial variability of vehicle densities as determinant of urban network capacity , 2009, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[7]  Yanqun Jiang,et al.  A dynamic traffic assignment model for a continuum transportation system , 2011 .

[8]  Carlos F. Daganzo,et al.  On Stochastic Models of Traffic Assignment , 1977 .

[9]  Meead Saberi,et al.  Urban Network Gridlock: Theory, Characteristics, and Dynamics , 2013 .

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

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

[12]  Haris N. Koutsopoulos,et al.  DEVELOPMENT OF A ROUTE GUIDANCE GENERATION SYSTEM FOR REAL-TIME APPLICATION , 1997 .

[13]  Vikash V. Gayah,et al.  Clockwise Hysteresis Loops in the Macroscopic Fundamental Diagram , 2010 .

[14]  André de Palma,et al.  Dynamic Model of Peak Period Traffic Congestion with Elastic Arrival Rates , 1986, Transp. Sci..

[15]  Hani S. Mahmassani,et al.  Network performance under system optimal and user equilibrium dynamic assignments: Implications for , 1993 .

[16]  Nikolas Geroliminis,et al.  Traffic signal perimeter control with multiple boundaries for large urban networks , 2013, 16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013).

[17]  Nikolaos Geroliminis,et al.  Perimeter and boundary flow control in multi-reservoir heterogeneous networks , 2013 .

[18]  Christine Buisson,et al.  Exploring the Impact of Homogeneity of Traffic Measurements on the Existence of Macroscopic Fundamental Diagrams , 2009 .

[19]  Hai Yang,et al.  Traffic assignment and signal control in saturated road networks , 1995 .

[20]  N. Geroliminis,et al.  Existence of urban-scale macroscopic fundamental diagrams: Some experimental findings - eScholarship , 2007 .

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

[22]  Serge P. Hoogendoorn,et al.  DYNAMIC USER-OPTIMAL ASSIGNMENT IN CONTINUOUS TIME AND SPACE , 2004 .

[23]  Robert B. Dial,et al.  A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE , 1971 .

[24]  Nikolaos Geroliminis,et al.  Empirical Observations of Congestion Propagation and Dynamic Partitioning with Probe Data for Large-Scale Systems , 2014 .

[25]  S. P. Hoogendoorn,et al.  Routing Strategies Based on Macroscopic Fundamental Diagram , 2012 .

[26]  Bin Ran,et al.  MODELING DYNAMIC TRANSPORTATION NETWORKS : AN INTELLIGENT TRANSPORTATION SYSTEM ORIENTED APPROACH. 2ND REV. ED. , 1996 .

[27]  Nikolaos Geroliminis,et al.  Properties of a well-defined Macroscopic Fundamental Diagram for urban traffic , 2011 .

[28]  Chi-Wang Shu,et al.  Revisiting Jiang’s dynamic continuum model for urban cities , 2013 .

[29]  Nikolas Geroliminis,et al.  Cooperative traffic control of a mixed network with two urban regions and a freeway , 2013 .

[30]  Nikolas Geroliminis,et al.  Optimal Perimeter Control for Two Urban Regions With Macroscopic Fundamental Diagrams: A Model Predictive Approach , 2013, IEEE Transactions on Intelligent Transportation Systems.

[31]  Masao Kuwahara,et al.  Decomposition of the reactive dynamic assignments with queues for a many-to-many origin-destination pattern , 1997 .

[32]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

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

[34]  Jordi Casas,et al.  Dynamic Network Simulation with AIMSUN , 2005 .

[35]  Nikolaos Geroliminis,et al.  On the spatial partitioning of urban transportation networks , 2012 .

[36]  Hani S. Mahmassani,et al.  System optimal and user equilibrium time-dependent traffic assignment in congested networks , 1995, Ann. Oper. Res..

[37]  Vikash V. Gayah,et al.  Using Mobile Probe Data and the Macroscopic Fundamental Diagram to Estimate Network Densities , 2013 .

[38]  Ismail Chabini,et al.  Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time , 1998 .

[39]  Markos Papageorgiou,et al.  Dynamic modeling, assignment, and route guidance in traffic networks , 1990 .

[40]  Monica Menendez,et al.  Study on the number and location of measurement points for an MFD perimeter control scheme: a case study of Zurich , 2014, EURO J. Transp. Logist..

[41]  Anthony Chen,et al.  A DYNAMIC TRAFFIC ASSIGNMENT MODEL WITH TRAFFIC-FLOW RELATIONSHIPS , 1995 .

[42]  Nikolaos Geroliminis,et al.  Estimating MFDs in Simple Networks with Route Choice. , 2013 .

[43]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .