A Sequential Decomposition Framework and Method for Calibrating Dynamic Origin—Destination Demand in a Congested Network

This paper presents a two-stage model to calibrate the time-dependent, dynamic origin-destination (O–D) demand under congested traffic conditions. The first-stage model estimates O–D trip rates by minimizing link demand deviation with a one-norm formulation approach, so that over the calibration time period, the traffic demand on calibration links matches with the link demand from the field data. Due to its linear model structure, the first-stage model is more computationally effective and solvable on large real-life networks compared with the commonly seen least-square formulation. Then, a time-dependent user equilibrium traffic assignment model is formulated at the second stage to adjust the departure time profile iteratively, aiming to match the calibrated result with the field observed dynamic traffic condition, i.e., time-dependent speed profile. The second-stage model starts from the concept of a demand–capacity–volume relationship at a congested road segment, where demand exceeds supply, and utilizes shockwave theory to capture the differences between true demand and volume output, together with the idea of using travel time propagation between origin and bottleneck locations to infer real demand at the origin location. The two-stage model was implemented and tested in a case study in Tucson, AZ, USA, as an experimental proof of concept, which demonstrated the effectiveness of the proposed calibration framework and method under circumstances, in which the departure time profile was systematically distorted and initial demand solutions deviated from the true O–D matrices.

[1]  Laura Wynter,et al.  A New One-Level Convex Optimization Approach For Estimating Origin-Destination Demand , 2012 .

[2]  Adolf D. May,et al.  Traffic Flow Fundamentals , 1989 .

[3]  Agachai Sumalee,et al.  21st International Symposium on Transportation and Traffic TheoryEstimation of mean and covariance of stochastic multi-class OD demands from classified traffic counts , 2015 .

[4]  Antoine G. Hobeika,et al.  Parameter optimization methods for estimating dynamic origin-destination trip-tables , 1997 .

[5]  Chung-Cheng Lu,et al.  Dynamic origin-destination demand flow estimation under congested traffic conditions , 2013 .

[6]  Xianbiao Hu,et al.  Developing the Analysis Methodology and Platform for Behaviorally Induced System Optimal Traffic Management , 2013 .

[7]  Agachai Sumalee,et al.  Estimation of mean and covariance of stochastic multi-class OD demands from classified traffic counts , 2015 .

[8]  Malachy Carey,et al.  A Method for Direct Estimation of Origin/Destination Trip Matrices , 1981 .

[9]  Moshe Ben-Akiva,et al.  Online deployment of dynamic traffic assignment: architecture and run-time management , 2006 .

[10]  M. Ben-Akiva,et al.  An enhanced SPSA algorithm for the calibration of Dynamic Traffic Assignment models , 2015 .

[11]  Constantinos Antoniou,et al.  On-line calibration for dynamic traffic assignment , 2004 .

[12]  Francesco Viti,et al.  New Gradient Approximation Method for Dynamic Origin–Destination Matrix Estimation on Congested Networks , 2011 .

[13]  Yu Nie,et al.  A Variational Inequality Formulation for Inferring Dynamic Origin-Destination Travel Demands , 2008 .

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

[15]  Martin L. Hazelton,et al.  Estimation of origin–destination matrices from link counts and sporadic routing data , 2012 .

[16]  Ernesto Cipriani,et al.  A Gradient Approximation Approach for Adjusting Temporal Origin–Destination Matrices , 2011 .

[17]  Francesco Viti,et al.  A density-based dynamic OD estimation method that reproduces within-day congestion dynamics , 2010, 13th International IEEE Conference on Intelligent Transportation Systems.

[18]  Hani S. Mahmassani,et al.  Time-Dependent Origin–Destination Demand Estimation , 2011 .

[19]  E. Jenelius,et al.  c-SPSA: Cluster-wise simultaneous perturbation stochastic approximation algorithm and its application to dynamic origin–destination matrix estimation , 2015 .

[20]  Haris N. Koutsopoulos,et al.  Offline Calibration of Dynamic Traffic Assignment , 2007 .

[21]  Hani S. Mahmassani,et al.  Dynamic origin-destination demand estimation using automatic vehicle identification data , 2006, IEEE Transactions on Intelligent Transportation Systems.

[22]  Hai Yang,et al.  Estimation of origin-destination matrices from link traffic counts on congested networks , 1992 .

[23]  Hani S. Mahmassani,et al.  A structural state space model for real-time traffic origin–destination demand estimation and prediction in a day-to-day learning framework , 2007 .

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

[25]  Fulvio Simonelli,et al.  Quasi-dynamic estimation of o–d flows from traffic counts: Formulation, statistical validation and performance analysis on real data , 2013 .

[26]  Haris N. Koutsopoulos,et al.  Calibration of Microscopic Traffic Simulation Models , 2007 .

[27]  Taehyung Park,et al.  Estimation of dynamic origin-destination trip tables for a general network , 2001 .

[28]  Pu Wang,et al.  Development of origin–destination matrices using mobile phone call data , 2014 .

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

[30]  M. Bierlaire.  MEUSE: an origin-destination matrix estimator that exploits structure , 1995 .

[31]  Mark Campbell,et al.  Calibration and Application of a Simulation-Based Dynamic Traffic Assignment Model , 2004 .