{'fraction_non_alphanumeric': 0.016551724137931035, 'fraction_numerical': 0.0, 'mean_word_length': 5.3130434782608695, '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}}
Simulating vehicular traffic in a network using dynamic routing

We present a new numerical code which solves the Lighthill – Whitham model, the classic macroscopic model for vehicular traffic flow, in a network with multi-destinations. We use a high-resolution shock-capturing scheme with approximate Riemann solver to solve the partial differential equations of the Lighthill – Whitham theory. These schemes are very efficient, robust and moreover well adapted to simulations of traffic flows. We develop a theory of dynamic routing including a procedure for traffic flow assignment at junctions which reproduces the correct propagation of irregularities and ensures at the same time conservation of the number of vehicles.