ACO for solving a multimodal transport problems using a transfer graph model

This paper proposes an algorithm based on a transfer graph model to compute a multimodal shortest path (MSP) between a given source node s and a destination node d. The first step of this algorithm consists of computing a database saving a large part of necessary data to provide a response to a user itinerary request. Whe show in this paper that using ant colony optimization metaheuristic (ACO) to compute this database, reduces considerably the memory space complexity comparing to the Dijskstra algorithm.