This paper considers the Capacitated Location-Routing Problem with Homogeneous Fleet (CLRP). The objective is to minimize the sum of the open depots' costs, the costs for the used vehicles, and the costs associated with the distances traveled. A metaheuristic algorithm of two phases for the CLRP is proposed. In the first phase, customers establish the clusters to be subsequently heuristically assigned to the depots. In the second phase, the initial routes are improved using an algorithm based on Ant Colony. The obtained results show the efficiency of the proposed approach.
A hybrid metaheuristic algorithm for the capacitated location routing problem
