Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem

Resumen

Location-Routing Problem (LRP) is related to logistics system of supply chain. In LRP, aims are facility location problem and vehicle routing problem that are considered simultaneously. As shown in recent researches, the costs in distribution systems may be excessive if routes are ignored when locating depots. In this paper, a heuristic method in four phases is developed to solve Capacitated Location-Routing Problem (CLRP). In phase 1, the customers are clustered according to greedy search method. Second phase, chooses the proper depots among candidates to be established. Third phase, allocates the clusters to depots. In final phase, Ant Colony System (ACS) is used for routing among depots and customers. The experimental results show the efficiency of our approach.