 |
|
| HAL : hal-00348411, version 1 |
| Fiche détaillée |  Récupérer au format |
 |
| Annual Meeting of the Transportation Research Board, Washington : États-Unis (2009) |
|
|
|
|
| On large size problems of dynamic network assignment and traffic equilibrium: Computational principles and application to Paris road network |
|
|
Fabien Leurent 1Vincent Aguiléra 1 |
|
|
| (01/2009) |
|
|
|
| The paper reports on the algorithmic treatment and computer implementation of a macroscopic dynamic traffic assignment model called LADTA. The modelling assumptions and the mathematical analysis founding the model are first stated. Detailed descriptions of the main algorithms are given, together with the principles of the computer implementation. It is shown how the design of the software architecture allows for distributed computation of a traffic assignment. The practical ability of this implementation to tackle with large size networks is illustrated by an application to the Paris road network, which comprises around 1,300 zones and 39,000 links. |
|
|
|
|
|
|
|
|
|
|
|
| 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 |
|
|
| Network assignment – Dynamic Equilibrium – Assignment algorithms – Dynamic least cost paths – Dynamic network loading – Continuous time – Computer implementation – Paris road network |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00348411, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00348411 | |
| oai:hal.archives-ouvertes.fr:hal-00348411 | |
| Contributeur : Fabien Leurent | |
| Soumis le : Jeudi 18 Décembre 2008, 17:45:23 | |
| Dernière modification le : Vendredi 2 Janvier 2009, 13:44:02 | |
