| HAL : hal-00605012, version 1 |
| Fiche détaillée | Récupérer au format |
|
|
|
|
| A Stochastic Model of Trip End Disaggregation in Traffic Assignment to a Transportation Network |
|
|
| Fabien Leurent 1Vincent Benezech 1 |
|
|
| (30/06/2011) |
|
|
| So far, traffic assignment to a network has been modelled by aggregating trip ends into zone centroids. The paper introduces a disaggregate model of trip ends, by associating to each zone a set of 'anchor nodes' for network access and a random vector of 'terminal costs' (or time) between trip ends and zonal anchors. These can be specified by OD pair. Assuming that terminal costs and network costs are independent, the system assignment can be performed in two stages, respectively network and terminal. A probit model based on Clark's formulas is recommended. A computation scheme is provided that loads OD flows by anchor pair onto the network in an efficient way. A binary case is addressed as illustration. Also reported is an application to the roadway network of the Paris area. |
|
|
|
|
|
|
|
|
|
|
| 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 |
|
|
| Traffic assignment – trip disaggregation – discrete choice model |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|
|
| hal-00605012, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00605012 | |
| oai:hal.archives-ouvertes.fr:hal-00605012 | |
| Contributeur : Fabien Leurent | |
| Soumis le : Jeudi 30 Juin 2011, 18:03:11 | |
| Dernière modification le : Vendredi 1 Juillet 2011, 09:51:42 | |