A metaheuristic dynamic traffic assignment model for O-D matrix estimation using aggregate data

For a static/dynamic O-D matrix estimation, usually, the basic required information is a starting estimation of O-D matrix and a set of traffic counts. In the era of the Intelligent Transportation Systems, a dynamic estimation of traffic demand has become a crucial issue. Different Dynamic Traffic Assignment (DTA) models have been proposed, used also for O-D matrices estimation. This paper presents a dynamic O-D demand estimator, using a novel simulation-based DTA algorithm. The core of the proposed algorithm is a mesoscopic dynamic network loading model used in conjunction with a Bee Colony Optimization (BCO). The BCO is capable to solve high level combinatorial problems with fast convergence performances, allowing to overcome classical demand-flow relationships drawbacks.

[1]  Kalidas Ashok,et al.  DYNAMIC ORIGIN-DESTINATION MATRIX ESTIMATION AND PREDICTION FOR REAL- TIME TRAFFIC MANAGEMENT SYSTEMS , 1993 .

[2]  Sang Nguyen,et al.  A unified framework for estimating or updating origin/destination matrices from traffic counts , 1988 .

[3]  Dušan Teodorović,et al.  Mitigating Traffic Congestion: Solving the Ride-Matching Problem by Bee Colony Optimization , 2008 .

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

[5]  E Cascetta,et al.  CLASS OF TRAVEL DEMAND ESTIMATORS USING TRAFFIC FLOWS , 1986 .

[6]  Michel Bierlaire,et al.  Bayesian Demand Calibration for Dynamic Traffic Simulations , 2011, Transp. Sci..

[7]  Neal M. Williams,et al.  Trapline foraging by bumble bees: III. Temporal patterns of visitation and foraging success at single plants , 1998 .

[8]  Haris N. Koutsopoulos,et al.  Calibration and Validation of Microscopic Traffic Simulation Tools: Stockholm Case Study , 2003 .

[9]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[10]  Hani S. Mahmassani,et al.  Dynamic Network Traffic Assignment and Simulation Methodology for Advanced System Management Applications , 2001 .

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

[12]  Ronghui Liu,et al.  Doubly Dynamic Traffic Assignment , 2007 .

[13]  Haris N. Koutsopoulos,et al.  Real Time Simulation of Traffic Demand-Supply Interactions within DynaMIT , 1999 .

[14]  J. L. Gould.  Landmark learning by honey bees , 1987, Animal Behaviour.

[15]  K. Waddington,et al.  Effects of pollen quality and genotype on the dance of foraging honey bees , 1998, Animal Behaviour.

[16]  S. Bera,et al.  Estimation of origin-destination matrix from traffic counts: the state of the art , 2011 .

[17]  Peter Wagner,et al.  Calibration and Validation of Microscopic Traffic Flow Models , 2004, SimVis.

[18]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

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

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

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

[22]  P. Kirk Visscher,et al.  Lifetime learning by foraging honey bees , 1994, Animal Behaviour.

[23]  Ennio Cascetta,et al.  Dynamic Estimators of Origin-Destination Matrices Using Traffic Counts , 1993, Transp. Sci..

[24]  N. J. Van der Zijpp,et al.  Estimation of Origin-Destination Demand for Dynamic Assignment with Simultaneous Route and Departure Time Choice , 2001 .

[25]  Shlomo Bekhor,et al.  A dynamic traffic assignment model for the assessment of moving bottlenecks , 2009 .

[26]  Maria Nadia Postorino,et al.  Fixed Point Approaches to the Estimation of O/D Matrices Using Traffic Counts on Congested Networks , 2001, Transp. Sci..

[27]  Moshe E. Ben-Akiva,et al.  Estimation and Prediction of Time-Dependent Origin-Destination Flows with a Stochastic Mapping to Path Flows and Link Flows , 2002, Transp. Sci..

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

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

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

[31]  Francesco Russo,et al.  Calibrating aggregate travel demand models with traffic counts: Estimators and statistical performance , 1997 .

[32]  Nanne J. Van Der Zijpp,et al.  Dynamic Origin-Destination Matrix Estimation from Traffic Counts and Automated Vehicle Identification Data , 1997 .

[33]  Qiang Meng,et al.  Simultaneous Estimation of the Origin-Destination Matrices and Travel-Cost Coefficient for Congested Networks in a Stochastic User Equilibrium , 2001, Transp. Sci..

[34]  Michel Bierlaire,et al.  An Efficient Algorithm for Real-Time Estimation and Prediction of Dynamic OD Tables , 2004, Oper. Res..

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

[36]  Haris N. Koutsopoulos,et al.  Network State Estimation and Prediction for Real-Time Traffic Management , 2001 .

[37]  F. Viti,et al.  Dynamic origin–destination estimation in congested networks: theoretical findings and implications in practice , 2013 .