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

Authors:
Ayed Hedi;Zineb Habbas;Carlos Galvez-Fernandez;Djamel Khadraoui
Affiliations:
University Paul Verlaine of Metz, France and CRP Henri Tudor, Luxembourg;University Paul Verlaine of Metz, France;CRP Henri Tudor, Luxembourg;CRP Henri Tudor, Luxembourg
Venue:
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
Year:
2009

Citing 3
Cited 0

Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Ant colony optimization

IEEE Computational Intelligence Magazine
Algorithms for Itinerary Planning in Multimodal Transportation Networks

IEEE Transactions on Intelligent Transportation Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.