A high performance algorithmic variant of MATSim road traffic simulator

Sara Moukir (1, 2) , Nahid Emad (1, 2) , Stéphane Baudelocq (3)

1 LI-PaRAD - Laboratoire d'Informatique Parallélisme Réseaux Algorithmes Distribués
2 MDLS - Maison de la Simulation
3 Groupe Eiffage

In this paper, we propose a new high-performance computing approach to road traffic simulation. Multi-agent road traffic simulators are the most accurate and realistic that currently exist, however they are very resource intensive and the data are massive when simulating a metropolis or a region. The main contribution of this paper is the presentation of a new concept based on the Unite and Conquer approach, allowing to set up several parallel executions with different parameters. Applied on MATSim, one of the most present multi-agent traffic simulators in the literature, it allows to reduce the number of iterations needed to converge to the optimal solution. In this paper, we show how the Unite and Conquer approach applied to MATSim brings a substantial gain in computing time and points out its potential application to other multi-agent simulators.

Mots clés: road traffic simulation; big data analysis; high performance computing; complex and heterogeneous dynamic system; Unite and Conquer; MATSim; parallel computing

Domaines: Informatique [cs]; Mathématiques [math]

Sara Moukir, Nahid Emad, Stéphane Baudelocq. A high performance algorithmic variant of MATSim road traffic simulator. IPDPSW 2023 - IEEE International Parallel and Distributed Processing Symposium Workshops, May 2023, St petersburg, United States. pp.914-922, ⟨10.1109/IPDPSW59300.2023.00149⟩. ⟨hal-04496008⟩