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

0Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Idri, A., Oukarfi, M., Boulmakoul, A., Zeitouni, K., & Masri, A. (2017). A distributed approach for shortest path algorithm in dynamic multimodal transportation networks. In Transportation Research Procedia (Vol. 27, pp. 294–300). Elsevier B.V. https://doi.org/10.1016/j.trpro.2017.12.094

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free