Accéder directement au contenu Accéder directement à la navigation
Article dans une revue

Large Problems of Dynamic Network Assignment and Traffic Equilibrium. Computational Principles and Application to Paris Road Network

Abstract : The paper reports on the algorithmic treatment and computer implementation of a macroscopic dynamic traffic assignment model called LADTA. The modeling assumptions and the mathematical analysis founding the model are first explained. Detailed descriptions of the main algorithms are given, together with the principles of the computer implementation. How the design of the software architecture allows for distributed computation of a traffic assignment is shown. The practical ability of this implementation to tackle large networks is illustrated by an application to the Paris road network, which comprises about 1,300 zones and 39,000 links.
Type de document :
Article dans une revue
Liste complète des métadonnées

https://hal-enpc.archives-ouvertes.fr/hal-00740620
Contributeur : Ist Enpc <>
Soumis le : mercredi 10 octobre 2012 - 15:28:48
Dernière modification le : vendredi 17 juillet 2020 - 17:08:53

Identifiants

Citation

Fabien Leurent, Vincent Aguiléra. Large Problems of Dynamic Network Assignment and Traffic Equilibrium. Computational Principles and Application to Paris Road Network. Transportation Research Record, SAGE Journal, 2009, pp.122-132. ⟨10.3141/2132-14⟩. ⟨hal-00740620⟩

Partager

Métriques

Consultations de la notice

234