Dynamic Origin-Destination Demand Estimation Using Turning Movement Counts

A dynamic origin-destination (O-D) demand estimation model is presented that uses turning movement counts as observations. Based on an iterative bilevel estimation framework, the upper-level problem is to minimize a weighted objective function of the deviation between simulated link flows and real-time link counts and the deviation between estimated time-dependent demand and an a priori historical O-D table, where the weighting value is determined by an interactive approach to obtain the best compromise solution. A case study was performed on the US-29 network in Maryland to compare the estimated tables of this approach with the one obtained from the traditional method, which uses only approach link volume counts. The application illustrates considerable benefits of using turning movements instead of approach volumes in matching observed counts.

[1]  Hani S. Mahmassani,et al.  Dynamic Origin-Destination Demand Estimation with Multiday Link Traffic Counts for Planning Applications , 2003 .

[2]  James V. Krogmeier,et al.  Dynamic Estimation and Prediction of Freeway O-D Matrices with Route Switching Considerations and Time-Dependent Model Parameters , 1996 .

[3]  I Okutani,et al.  Dynamic prediction of traffic volume through Kalman Filtering , 1984 .

[4]  Hanif D. Sherali,et al.  Estimation of origin–destination trip-tables based on a partial set of traffic link volumes , 2003 .

[5]  Yu Nie,et al.  A One-Level O-D Estimation Approach Based on Relaxation , 2007 .

[6]  M. Cremer,et al.  A new class of dynamic methods for the identification of origin-destination flows , 1987 .

[7]  Bruce Hellinga,et al.  ESTIMATING DYNAMIC ORIGIN- DESTINATION DEMANDS FROM LINK AND PROBE COUNTS , 2001 .

[8]  Gary A. Davis,et al.  Application of Prediction-Error Minimization and Maximum Likelihood to Estimate Intersection O-D Matrices from Traffic Counts , 1989, Transp. Sci..

[9]  M. Bell.  THE ESTIMATION OF ORIGIN-DESTINATION MATRICES BY CONSTRAINED GENERALISED LEAST SQUARES , 1991 .

[10]  Moshe E. Ben-Akiva,et al.  Alternative Approaches for Real-Time Estimation and Prediction of Time-Dependent Origin-Destination Flows , 2000, Transp. Sci..

[11]  Baher Abdulhai,et al.  Noniterative Approach to Dynamic Traffic Origin-Destination Estimation with Parallel Evolutionary Algorithms , 2006 .

[12]  V F Hurdle,et al.  DYNAMIC IDENTIFICATION OF FLOWS FROM TRAFFIC COUNTS AT COMPLEX INTERSECTIONS , 1983 .

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

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

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

[16]  Xuesong Zhou,et al.  DYNAMIC ORIGIN-DESTINATION DEMAND ESTIMATION AND PREDICTION FOR OFF-LINE AND ON-LINE DYNAMIC TRAFFIC ASSIGNMENT OPERATION , 2004 .

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

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

[19]  Antony Stathopoulos,et al.  Simultaneous Origin-Destination Matrix Estimation in Dynamic Traffic Networks with Evolutionary Computing , 2009, EvoWorkshops.