Memetic algorithm for computing shortest paths in multimodal transportation networks

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. (C) 2015 The Authors. Published by Elsevier B.V.