Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

Memetic Algorithm for Computing Shortest Paths in Multimodal Transportation Networks

Abstract : Route planning in multimodal transportation networks is gaining more and more importance. Travelers ask for efficient routing methods allowing them to reach their destinations through the intricate multimodal transportation scheme. In this paper, we propose a new approach for computing multi-modal shortest paths. We only consider railway, bus and pedestrian networks. The travel time is the only metric in our cost function. Our proposed approach is a combination of two meta-heuristics: Genetic Algorithm (GA) and Variable Neighborhood Search (VNS). We compare our approach with the exact shortest path algorithm Dijikstra that has been modified to work in a multimodal environment, as well as, with a pure GA. Results have shown that the success rate of our approach in terms of converging to optimum/near optimum solutions is highly better than a pure GA. Moreover, in contrast to traditional algorithms like Dijkstra, our approach is fast enough for practical routing applications.
Document type :
Journal articles
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Omar DIB Connect in order to contact the contributor
Submitted on : Tuesday, May 9, 2017 - 7:09:13 PM
Last modification on : Saturday, May 13, 2017 - 1:08:18 AM
Long-term archiving on: : Thursday, August 10, 2017 - 1:52:07 PM


EWGT2015 OmarDIB - Full Paper....
Publisher files allowed on an open archive



Omar Dib, Marie-Ange Manier, Alexandre Caminada. Memetic Algorithm for Computing Shortest Paths in Multimodal Transportation Networks. Transportation Research Procedia, Elsevier, 2015, 10, pp.745 - 755. ⟨10.1016/j.trpro.2015.09.028⟩. ⟨hal-01520123⟩



Record views


Files downloads