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

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.