Résumé:
—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.
