A Memetic Algorithm for the Capacitated Location-Routing Problem

In this paper, a hybrid genetic algorithm is proposed to solve a Capacitated Location-Routing Problem. The objective is to minimize the total cost of the distribution in a network composed of depots and customers, both depots and vehicles have limited capacities, each depot has a homogenous vehicle fleet and customers’ demands are known and must be satisfied. Solving this problem involves making strategic decisions such as the location of depots, as well as tactical and operational decisions which include assigning customers to the opened depots and organization of the vehicle routing. To evaluate the performance of the proposed algorithm, its results are compared to those obtained by a greedy randomized adaptive search procedure, computational results shows that the algorithm gave good quality solutions

@article{KECHMANE2016,
  title     = {A Memetic Algorithm for the Capacitated Location-Routing Problem},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {7},
  number    = {6},
  year      = {2016},
  publisher = {The Science and Information Organization},
  author    = {Laila KECHMANE and Benayad NSIRI and Azeddine BAALAL},
  doi       = {10.14569/IJACSA.2016.070628},
  url       = {https://doi.org/10.14569/IJACSA.2016.070628}
}