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

Author

Hedi, Ayed ; Habbas, Zineb ; Khadraoui, Djamel

Author_Institution

Univ. Paul Verlaine-Metz, Metz, France

fYear

2009

fDate

6-9 July 2009

Firstpage

285

Lastpage

290

Abstract

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.

Keywords

goods distribution; graph theory; optimisation; transportation; Dijskstra algorithm; ant colony optimization metaheuristic; memory space complexity; multimodal shortest path; multimodal transport problem; transfer graph model; Ant colony optimization; Bicycles; Computer networks; Databases; Legged locomotion; Management information systems; Marine vehicles; Motorcycles; Rail transportation; Shortest path problem; ACO; Dijkstra algorithm; Multimodal transport; Shortest Path Problem; Time dependent network problem; transfer graph;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Conference_Location

Troyes

Print_ISBN

978-1-4244-4135-8

Electronic_ISBN

978-1-4244-4136-5

Type

conf

DOI

10.1109/ICCIE.2009.5223969

Filename

5223969