A distributed approach for shortest path algorithm in dynamic multimodal transportation networks - Université de Lille Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

A distributed approach for shortest path algorithm in dynamic multimodal transportation networks

Résumé

In this paper we introduce a search approach for shortest path algorithm in a parallel distributed architecture which is designed to handle the time-dependency for multimodal transportation network. Our proposed algorithm relies on its effective target-oriented approach of reducing the search space while the distributed parallel processing focuses on reducing the computational time. The optimality of the algorithm is principally based on computing a virtual path which is basically an Euclidean distance from the source to the destination aiming at a restriction of the search space. After the presentation of the distributed algorithm, a profiling of the algorithm is given to evaluate its computing performance.
Fichier principal
Vignette du fichier
1-s2.0-S2352146517309912-main.pdf (658.45 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04371619 , version 1 (03-01-2024)

Licence

Identifiants

Citer

Abdelfattah Idri, Mariyem Oukarfi, Azedine Boulmakoul, Karine Zeitouni, Ali Masri. A distributed approach for shortest path algorithm in dynamic multimodal transportation networks. 20th EURO Working Group on Transportation Meeting, EWGT 2017, Sep 2017, Budapest, Hungary. pp.294-300, ⟨10.1016/j.trpro.2017.12.094⟩. ⟨hal-04371619⟩
10 Consultations
5 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More