{'fraction_non_alphanumeric': 0.012515644555694618, 'fraction_numerical': 0.011264080100125156, 'mean_word_length': 5.6115702479338845, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On large size 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 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.