A parallel algorithm for solving time dependent multimodal transport problem

This paper deals with the Time Dependent Multimodal Transport Problem (TDMTP). The main contribution of this work is to propose a parallel algorithm for solving the TDMTP in very large transport networks. This new ad-hoc parallel approach takes advantage of the possible decomposition of real transport networks according to transport modes and regions. We implemented our algorithm using a parallel shared memory machine, being tested in a super computer cluster. The first experiments results on random theoretical graphs as well as on real transport networks are very promising.