2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
A Tabu Search and Ant Colony System Approach for the Capacitated Location-Routing Problem
August 06-August 08
ISBN: 978-0-7695-3263-9
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.
Index Terms:
Ant Colony System, Tabu Search, Optimization, Capacitated Location-Routing problem
Citation:
Lyamine Bouhafs, Amir Hajjam, Abderrafiaa Koukam, "A Tabu Search and Ant Colony System Approach for the Capacitated Location-Routing Problem," snpd, pp.46-50, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008