Estimation of Time-Dependent Origin-Destination Matrices Using the Path Flow Proportion Method

This research formulates the time-dependent origin-destination (O-D) matrix estimation problem as a system of linear equations and solves this problem by using the conditional inverse matrix theory. One of the unique aspects of the adopted matrix inverse method is that it provides a generalized matrix inverse procedure even if the target matrix is either singular or non-squared. Due to the multiple solutions problem when solving the O-D matrix estimation problem, the path flow proportion method is developed in the present study and the unique solution of the O-D matrix estimation problem can be obtained. In the numerical analysis, the developed model framework and solution algorithm are evaluated based on a simplified network. The numerical analysis result reveals that the time-dependent O-D demand estimates given by the proposed models and adopted solution algorithm can be estimated exactly.

[1]  Che-Fu Hsueh,et al.  A model and an algorithm for the dynamic user-optimal route choice problem , 1998 .

[2]  Anthony Chen,et al.  Norm approximation method for handling traffic count inconsistencies in path flow estimator , 2009 .

[3]  George F. List,et al.  An Information-Theoretic Sensor Location Model for Traffic Origin-Destination Demand Estimation Applications , 2010, Transp. Sci..

[4]  Monica Gentili,et al.  Locating Active Sensors on Traffic Networks , 2005, Ann. Oper. Res..

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

[6]  E. Cascetta Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator , 1984 .

[7]  R. Sivanandan,et al.  A linear programming approach for synthesizing origin-destination trip tables from link traffic volumes , 1994 .

[8]  F. Graybill An introduction to linear statistical models , 1961 .

[9]  H. Chen,et al.  Dynamic Travel Choice Models: A Variational Inequality Approach , 1998 .

[10]  Wilfred W. Recker,et al.  Improved Path Flow Estimator for Origin-Destination Trip Tables , 2005 .

[11]  Luis G. Willumsen,et al.  ESTIMATION OF AN O-D MATRIX FROM TRAFFIC COUNTS - A REVIEW , 1978 .

[12]  Enrique Castillo,et al.  Trip matrix and path flow reconstruction and estimation based on plate scanning and link observations , 2008 .

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

[14]  Stephen H. Friedberg,et al.  Linear Algebra , 2018, Computational Mathematics with SageMath.

[15]  H. M. Zhang,et al.  A Relaxation Approach for Estimating Origin–Destination Trip Tables , 2010 .

[16]  Der-Horng Lee,et al.  Uncoupled Method for Equilibrium-Based Linear Path Flow Estimator for Origin-Destination Trip Matrices , 2002 .

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

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

[19]  Anders Peterson,et al.  A heuristic for the bilevel origin-destination-matrix estimation problem , 2008 .

[20]  H. M. Zhang,et al.  Inferring origin–destination trip matrices with a decoupled GLS path flow estimator , 2005 .

[21]  Henk J van Zuylen,et al.  The most likely trip matrix estimated from traffic counts , 1980 .

[22]  Hai Yang Heuristic algorithms for the bilevel origin-destination matrix estimation problem , 1995 .

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