 |
|
|
|
| HAL : hal-00348413, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| Annual Meeting of the Transportation Research Board, Washington : États-Unis (2009) |
|
|
|
|
| Optimal Network Estimation of Origin-Destination Flow from Sufficient Link Data |
|
|
| Fabien Leurent 1Frédéric Meunier 1 |
|
|
| (01/2009) |
|
|
|
| A systematic method is provided to estimate an origin destination flow at the network level on the basis of link traffic counts with OD structure. The estimator has minimal variance among the unbiased linear combinations of link estimators. The problem to find the optimal estimator is stated as a linear system in node potentials; it is endowed with nice properties of existence and uniqueness, which enjoy a structural, graph-based interpretation. Assuming independent local estimators, an equivalent, dual problem is that of minimizing the imprecision energy carried by a network flow. The estimation method does not require assumptions on route choice proportions. Throughout the paper, a realistic case is addressed both to discuss the practical issues and to demonstrate the solution method. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire Ville, Mobilité, Transport (LVMT) |
|
|
|
Université Paris-Est Marne-la-Vallée (UPEMLV) – Ecole des Ponts ParisTech – IFSTTAR UMR-T9404 |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Modélisation et simulation |
|
|
| Graph cut – Graph Laplacian – Feasible differential problem – Imprecision flow – Unbiased estimator – Variance minimization |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00348413, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00348413 | |
| oai:hal.archives-ouvertes.fr:hal-00348413 | |
| Contributeur : Fabien Leurent | |
| Soumis le : Jeudi 18 Décembre 2008, 17:53:00 | |
| Dernière modification le : Vendredi 2 Janvier 2009, 22:59:02 | |
