Abstract
Suppose given a network endowed with a multiflow. We want to estimate some quantities connected with this multiflow, for instance the value of an s–t flow for one of the sources–sinks pairs s–t, but only measures on some arcs are available, at least on one s–t cocycle (set of arcs having exactly one endpoint in a subset X of vertices with s∈X and t∉X). These measures, supposed to be unbiased, are random variables whose variances are known. How can we combine them optimally in order to get the best estimator of the value of the s–t flow?
This question arises in practical situations when the OD matrix of a transportation network must be estimated. We will give a complete answer for the case when we deal with linear combinations, not only for the value of an s–t flow but also for any quantity depending linearly from the multiflow. Interestingly, we will see that the Laplacian matrix of the network plays a central role.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bierlaire, M., & Toint, P. (1995). An origin-destination matrix estimator that exploits structure. Transportation Research, Part B: Methodology, 29, 47–60.
Cascetta, E., & Nguyen, S. (1988). A unified framework for estimating or updating origin/destination matrices from traffic counts. Transportation Research, Part B: Methodology, 22, 437–455.
Chaiken, S. (1982). A combinatorial proof of the all minors matrix tree theorem. SIAM Journal on Algebraic and Discrete Methods, 3, 319–329.
Leurent, F. (1999). Estimer un modèle de distribution spatiale avec des enquêtes en-route. In M. Aron, F. Boillot, & J.-P. Lebacque (Eds.), Actes INRETS (France) : Vol. 83. Modélisation du trafic (pp. 85–102). Bron: INRETS.
Leurent, F., & Meunier, F. Optimal network estimation of origin-destination flow from sufficient link data. In Proc. of the 88th transportation research board meeting (Washington D.C., USA), January 2009.
Soule, A., Nucci, A., Cruz, R., Leonardi, E., & Taft, N. Estimating dynamic traffic matrices by using viable routing changes. In IEEE/ACM transactions on Networking (June 2007).
Spiess, H. (1987). A maximum likelihood model for estimating origin-destination matrices. Transportation Research, Part B: Methodology, 21, 395–412.
Vardi, Y. (1996). Estimating source-destination traffic intensities from link data. Journal of the American Statistical Association, 91, 433.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Meunier, F. Optimal linear estimator of origin-destination flows with redundant data. Ann Oper Res 181, 709–722 (2010). https://doi.org/10.1007/s10479-010-0784-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0784-0