Network traffic control based on a mesoscopic dynamic flow model

The paper focuses on Network Traffic Control based on aggregate traffic flow variables, aiming at signal settings which are consistent with within-day traffic flow dynamics. The proposed optimisation strategy is based on two successive steps: the first step refers to each single junction optimisation (green timings), the second to network coordination (offsets). Both of the optimisation problems are solved through meta-heuristic algorithms: the optimisation of green timings is carried out through a multi-criteria Genetic Algorithm whereas offset optimisation is achieved with the mono-criterion Hill Climbing algorithm. To guarantee proper queuing and spillback simulation, an advanced mesoscopic traffic flow model is embedded within the network optimisation method. The adopted mesoscopic traffic flow model also includes link horizontal queue modelling. The results attained through the proposed optimisation framework are compared with those obtained through benchmark tools.

[1]  J. Y. K. Luk,et al.  Two traffic responsive area traffic control methods: SCAT and SCOOT , 1983 .

[2]  B M Chard,et al.  TRANSYT, THE LATEST DEVELOPMENTS , 1987 .

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

[4]  Mauro Dell'Orco,et al.  Mesoscopic simulation of a dynamic link loading process , 2007 .

[5]  J H Wu,et al.  MODELLING THE SPILL-BACK OF CONGESTION IN LINK BASED DYNAMIC NETWORK LOADING MODELS: A SIMULATION MODEL WITH APPLICATION , 1999 .

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

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

[8]  Aleksandar Stevanovic,et al.  Field Evaluation of SCATS Traffic Control in Park City, UT , 2008 .

[9]  Huseyin Ceylan,et al.  A Hybrid Harmony Search and TRANSYT hill climbing algorithm for signalized stochastic equilibrium tr , 2012 .

[10]  Satish V. Ukkusuri,et al.  On the holding-back problem in the cell transmission based dynamic traffic assignment models , 2012 .

[11]  Mauro Dell'Orco,et al.  A Node-Based Modeling Approach for the Continuous Dynamic Network Loading Problem , 2009, IEEE Transactions on Intelligent Transportation Systems.

[12]  P Gower,et al.  CONTRAM, STRUCTURE OF THE MODEL , 1989 .

[13]  Michael Florian,et al.  Application of a simulation-based dynamic traffic assignment model , 2002 .

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

[15]  Michel Bierlaire,et al.  DynaMIT: Dynamic Network Assignment for the Management of Information to Travelers , 1996 .

[16]  James E. Baker,et al.  Adaptive Selection Methods for Genetic Algorithms , 1985, International Conference on Genetic Algorithms.

[17]  Massimo Di Gangi,et al.  Modeling Evacuation of a Transport System: Application of a Multimodal Mesoscopic Dynamic Traffic Assignment Model , 2011, IEEE Transactions on Intelligent Transportation Systems.

[18]  Ozgur Baskan,et al.  A modified reinforcement learning algorithm for solving coordinated signalized networks , 2015 .

[19]  Donald Richard Drew,et al.  Traffic flow theory and control , 1968 .

[20]  M. Di Gangi,et al.  EVALUATION OF CONTROL STRATEGIES THROUGH A DOUBLY DYNAMIC ASSIGNMENT MODEL , 1991 .

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

[22]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[23]  Giulio Erberto Cantarella,et al.  Signal Setting Design at a Single Junction Through the Application of Genetic Algorithms , 2014 .

[24]  Di Gangf Massimo.  Modelling dynamic network loading ontransportation networks through a continuous , 1996 .

[25]  Nathan H. Gartner,et al.  OPAC: A DEMAND-RESPONSIVE STRATEGY FOR TRAFFIC SIGNAL CONTROL , 1983 .

[26]  Heinz Spiess,et al.  Technical Note - Conical Volume-Delay Functions , 1990, Transp. Sci..

[27]  D I Robertson,et al.  User guide to TRANSYT version 6 , 1976 .

[28]  Nicholas B. Taylor.  The CONTRAM Dynamic Traffic Assignment Model , 2003 .

[29]  Hani S. Mahmassani,et al.  An evaluation tool for advanced traffic information and management systems in urban networks , 1994 .

[30]  Giulio Erberto Cantarella,et al.  Network Signal Setting Design: Meta-heuristic optimisation methods , 2015 .

[31]  Mauro Dell'Orco.  A dynamic network loading model for mesosimulation in transportation systems , 2006, Eur. J. Oper. Res..

[32]  D I Robertson,et al.  TRANSYT: A TRAFFIC NETWORK STUDY TOOL , 1969 .

[33]  Jean-Loup Farges,et al.  THE PRODYN REAL TIME TRAFFIC ALGORITHM , 1983 .

[34]  R. D. Bretherton,et al.  SCOOT VERSION 4 , 1998 .

[35]  Joseph L. Schofer,et al.  A STATISTICAL ANALYSIS OF SPEED-DENSITY HYPOTHESES , 1965 .

[36]  R B Potts,et al.  THE OVERSATURATED INTERSECTION , 1963 .

[37]  Vittorio Astarita,et al.  A CONTINUOUS TIME LINK MODEL FOR DYNAMIC NETWORK LOADING BASED ON TRAVEL TIME FUNCTION , 1996 .

[38]  Sam Yagar,et al.  DYNAMIC INTEGRATED FREEWAY/TRAFFIC SIGNAL NETWORKS: PROBLEMS AND PROPOSED SOLUTIONS , 1988 .

[39]  R D Bretherton,et al.  SCOOT-a Traffic Responsive Method of Coordinating Signals , 1981 .

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

[41]  Michael J. Smith,et al.  The Existence of a Time-Dependent Equilibrium Distribution of Arrivals at a Single Bottleneck , 1984, Transp. Sci..