By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bouhafs, L. ; Lab. Syst. et Transp., Univ. de Technol. de Belfort-Montbeliard, Belfort ; Hajjam, A. ; Koukam, A.

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.

Published in:

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

Date of Conference:

6-8 Aug. 2008