Application of Prediction-Error Minimization and Maximum Likelihood to Estimate Intersection O-D Matrices from Traffic Counts

Nancy L. Nihan and Gary A. Davis
Additional contact information
Nancy L. Nihan: University of Washington, Seattle, Washington 98185
Gary A. Davis: University of Washington, Seattle, Washington 98185

Transportation Science, 1989, vol. 23, issue 2, 77-90

Abstract: The use of prediction error and maximum likelihood techniques to estimate intersection turning and through movement probabilities from entering and exiting counts is considered here. A maximum likelihood estimator for situations when full information on turning movement counts is available is derived and used as a component for a maximum likelihood algorithm which only requires entering and exiting counts. Several algorithms based on minimizing the error between observed and predicted exiting counts are also developed. Some actual traffic data are collected and used to develop realistic simulations for evaluating the various estimators. Generally, the maximum likelihood algorithm produced biased but more efficient estimates, while prediction error minimization approaches produced unbiased but less efficient estimates. Constraining the recursive version of the ordinary least-squares estimator to satisfy natural constraints did not affect its long run convergence properties.

Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.23.2.77 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:23:y:1989:i:2:p:77-90

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().