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...

Full description

Saved in:
Bibliographic Details
Published in2009 International Conference on Computers & Industrial Engineering pp. 285 - 290
Main Authors Hedi, A., Habbas, Z., Khadraoui, D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2009
Subjects
ACO
Ant colony optimization
Bicycles
Computer networks
Dijkstra algorithm
Legged locomotion
Management information systems
Marine vehicles
Motorcycles
Multimodal transport
Rail transportation
Shortest path problem
Time dependent network problem
transfer graph
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9781424441358
1424441358
DOI:10.1109/ICCIE.2009.5223969