A hybrid adaptive iterated local search heuristic for the maximal covering location problem

Adaptive iterated local search (AILS) is a recently proposed metaheuristic paradigm that focuses on adapting the diversity control of iterated local search by online learning mechanisms. It has been successfully applied to the capacitated vehicle routing problem (CVRP) and the heterogeneous vehicle routing problem. Hybridizing it with path relinking (PR) has further improved the intensification of the method for the CVRP, providing outstanding results. However, the potential of this metaheuristic has not yet been investigated on other combinatorial optimization problems, such as location problems. In this paper, we develop a version of AILS for the maximal covering location problem (MCLP). This problem consists of locating a number of facilities to maximize the covered customer demand, where a given facility location can meet the demand of customers located within a coverage radius. Experiments on large-scale instances of the MCLP indicate that AILS hybridized with PR, called AILS-PR, outperforms the state-of-the-art metaheuristic.