The multimode covering location problem
We present a multimode generalization of the Maximal Covering Location Problem. We propose two greedy approximation algorithms for the new problem. We develop a Variable Neighborhood Search approach, whose local search procedure is based on Very Large Scale Neighborhood Search. We compare this approach with a basic VNS approach based on a polynomial sized neighborhood and with a Heuristic Concentration approach, which exploit general purpose exact solvers.
maximal covering location problem variable neighborhood search very large scale neighborhood search heuristic concentration