Hybrid algorithm for solving a multimodal transport problems using a transfer graph model

This paper presents an approach to the shortest path problem in time-dependent multimodal networks. The approach derives, from the initial graph, a more simplified and non-time-dependent structure, called abstract graph, by using ant colony optimization. Then, a time-dependent Dijkstra´s algorithm is used to compute the shortest path on the new structure. This approach improves two previous solutions proposed by the authors.