Clustering Search Algorithm Applied to the Partial Set Covering Location Problem

The Partial Set Covering Location Problem (PSCLP) consists of choosing a set of facilities geographically located to minimize their total opening cost and ensure that a certain partial amount of customer demand is covered. This article presents a Clustering Search algorithm (CS) associated with the Generalized Simulated Annealing metaheuristic (GSA) to solve this problem. In the computational experiment, instances with 10.000 and 50.000 clients found in the literature were tested using the CS-GSA algorithm. The results show that CS-GSA performed better than SA.