Some comments on origin–destination matrix estimation
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The use of second-order statistical properties of the data in O-D matrix estimation is explored, and a class of estimators proposed, and some avenues for future research outlined.
Abstract
Estimation of origin–destination (O–D) matrices from link count data is considered. This problem is challenging because the number of parameters to be estimated is typically larger than the number of network links. As a result, it is (usually) impossible to identify a unique optimal estimate of the O–D matrix from mean link traffic counts. However, information from the covariance matrix of link count data collected over a sequence of days can relieve this problem of indeterminacy. This fact is illustrated through a simple example. The use of second-order statistical properties of the data in O–D matrix estimation is then explored, and a class of estimators proposed. Practical problems of model mis-specification are discussed and some avenues for future research outlined.
