A Tabu Search and Ant Colony System Approach for the Capacitated Location-Routing Problem

Author

Bouhafs, Lyamine ; Hajjam, Amir ; Koukam, Abderrafiaa

Author_Institution

Lab. Syst. et Transp., Univ. de Technol. de Belfort-Montbeliard, Belfort

fYear

2008

fDate

6-8 Aug. 2008

Firstpage

46

Lastpage

50

Abstract

In this article we study the capacitated location routing problem (CLRP) which is defined as a combination of two problems: the facility location problem (FLP) and the vehicle routing problem (VRP). The CLRP is not just a purely academic construct; it has many applications in the practice. We propose a hybrid approach based on a tabu search algorithm combined with an improved ant colony system to solve the CLRP. The experimental results show the efficiency of our approach in comparison with the other methods found in the literature.

Keywords

facility location; optimisation; search problems; transportation; vehicles; ant colony system; capacitated location routing problem; facility location problem; tabu search; vehicle routing problem; Artificial intelligence; Clustering algorithms; Computer architecture; Costs; Distributed computing; Environmental factors; Integer linear programming; Intelligent vehicles; Routing; Software engineering; Ant Colony System; Capacitated Location-Routing problem; Optimization; Tabu Search;

fLanguage

English

Publisher

ieee

Conference_Titel

Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008. SNPD '08. Ninth ACIS International Conference on

Conference_Location

Phuket

Print_ISBN

978-0-7695-3263-9

Type

conf

DOI

10.1109/SNPD.2008.81

Filename

4617346