A Basic Variable Neighborhood Search for the Planar Obnoxious Facility Location Problem

Obnoxious facility location problems are devoted to choose the best location for a given set of facilities considering that, despite they should not be close to population communities, their service is needed, like the case of airports, paper factories or nuclear plants. In this paper we study the planar multiple obnoxious facility location problem. Our approach is based on a first discretization of the instance where a Basic Variable Neighborhood Search algorithm is applied. Our results improve the state of the art spending less than a third of the execution time of the second best algorithm.