An approach to estimating and updating origin-destination matrices based upon traffic counts preserving the prior structure of a survey matrix

The scope of this paper is eminently practical. It addresses the problem of estimating and updating observed O-D matrices based upon available link flow information by means of the non-linear programming approach corresponding to the Augmented Lagrangian Function (ALM). In this way, one can estimate O-D matrices in a way which uses an efficient algorithm that minimizes the amount of stored information required for solving large-sized problems. A solution algorithm is provided, which has been completely developed and designed to be used within commercial assignment codes. The limitations and the features of these programmes have, in a natural way, conditioned the solution adopted for the model proposed. The case of updating a trip matrix, from a home-based survey, of a real problem corresponding to an existing city is analysed. For this application case two methodologies are reviewed; the first one does not incorporate constraints related to the total number of trips, the zonal productions and attractions, or individual O-D pairs; the second one does take them into account. The results obtained from the application of the proposed method to a prior O-D trip matrix, show huge differences with respect to the results yielded when the adjustment process does not limit the variations of the single terms (O-D pairs) with upper or lower boundaries. This comparison is carried out and based upon the wide spread Spiess's Gradient Algorithm. The graphical results depict the drastic contrasts observed, related to the distortion experienced by the information contained in the O-D trip matrix of a home-based survey, when using this methodology and the one proposed here.

[1]  Per Högberg,et al.  Estimation of parameters in models for traffic prediction: A non-linear regression approach , 1976 .

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

[3]  Sue McNeil,et al.  A Regression Formulation of the Matrix Estimation Problem , 1985, Transp. Sci..

[4]  H. Spiess.  A MAXIMUM LIKELIHOOD MODEL FOR ESTIMATING ORIGIN-DESTINATION MATRICES , 1987 .

[5]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

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

[7]  A. Ravindran,et al.  Engineering Optimization: Methods and Applications , 2006 .

[8]  K. Jörnsten,et al.  Estimation of origin-destination matrices from traffic counts using multiobjective programming formulations , 1989 .

[9]  M Pursula,et al.  A BAYESIAN APPROACH TO UPDATE TRAFFIC FLOWS FROM TRAFFIC COUNTS. , 1993 .

[10]  Pierre N. Robillard,et al.  Estimating the O-D matrix from observed link volumes , 1975 .

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

[12]  Carlos F. Daganzo,et al.  TRANSPORTATION AND TRAFFIC THEORY , 1993 .

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

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

[15]  Michael G.H. Bell,et al.  The Estimation of an Origin-Destination Matrix from Traffic Counts , 1983 .

[16]  Alan Wilson,et al.  Entropy in urban and regional modelling , 1972, Handbook on Entropy, Complexity and Spatial Dynamics.

[17]  M. Maher.  INFERENCES ON TRIP MATRICES FROM OBSERVATIONS ON LINK VOLUMES: A BAYESIAN STATISTICAL APPROACH , 1983 .

[18]  Michael J. Maher,et al.  A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows , 2001 .

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

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

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

[22]  Michael Florian,et al.  Optimal strategies: A new assignment model for transit networks , 1989 .

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

[24]  William H. K. Lam,et al.  Estimation of an origin-destination matrix with random link choice proportions : a statistical approach , 1996 .

[25]  Malachy Carey,et al.  Constrained Estimation of Direct Demand Functions and Trip Matrices , 1986, Transp. Sci..