A combination of simulated annealing and ant colony system for the capacitated location-routing problem

Authors:
Lyamine Bouhafs;Amir hajjam;Abder Koukam
Affiliations:
Equipe Informatique, Laboratoire Systèmes et Transport, Université de Technologie de, Belfort-Montbéliard, Belfort, France;Equipe Informatique, Laboratoire Systèmes et Transport, Université de Technologie de, Belfort-Montbéliard, Belfort, France;Equipe Informatique, Laboratoire Systèmes et Transport, Université de Technologie de, Belfort-Montbéliard, Belfort, France
Venue:
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Year:
2006

Citing 1
Cited 4

Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

A simulated annealing heuristic for the capacitated location routing problem

Computers and Industrial Engineering
An ant colony optimization approach to solve cooperative transportation planning problems

Winter Simulation Conference
An ant colony optimization algorithm to solve the minimum cost network flow problem with concave cost functions

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Concave minimum cost network flow problems solved with a colony of ants

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Location-Routing Problem (LRP) can model several life situations. In this paper 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). We propose a two-phase approach to solve the CLRP. The approach is based on Simulated Annealing algorithm (SA) and Ant Colony System (ACS). The experimental results show the efficiency of our approach.