A Memetic Algorithm for the Capacitated Location-Routing Problem

@inproceedings{KECHMANE2016AMA,
  title={A Memetic Algorithm for the Capacitated Location-Routing Problem},
  author={Laila KECHMANE},
  year={2016}
}
  • Laila KECHMANE
  • Published 2016
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… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS