On large size problems of dynamic network assignment and traffic equilibrium: Computational principles and application to Paris road network - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

On large size problems of dynamic network assignment and traffic equilibrium: Computational principles and application to Paris road network

Résumé

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.
Fichier principal
Vignette du fichier
TRB09-1832-revised.pdf (1.05 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00348411 , version 1 (18-12-2008)

Identifiants

  • HAL Id : hal-00348411 , version 1

Citer

Fabien Leurent, Vincent Aguiléra. On large size problems of dynamic network assignment and traffic equilibrium: Computational principles and application to Paris road network. Transportation Research Board (TRB) 88th Annual Meeting, Jan 2009, Washington DC, United States. pp.#09-1832. ⟨hal-00348411⟩
212 Consultations
153 Téléchargements

Partager

Gmail Facebook X LinkedIn More