Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median Problem
|Title||Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median Problem|
|Publication Type||Journal Article|
|Year of Publication||2016|
|Authors||Colmenar, J M., P. Greistorfer, R. Martí, and A. Duarte|
|Journal||European Journal of Operational Research|
|Keywords||Diversity problem, Filter solutions, GRASP, Metaheuristics, Obnoxious location|
The Obnoxious p-Median problem consists in selecting a subset of p facilities from a given set of possible locations, in such a way that the sum of the distances between each customer and its nearest facility is maximized. The problem is NP-hard and can be formulated as an integer linear program. It was introduced in the 1990s, and a branch and cut method coupled with a tabu search has been recently proposed. In this paper, we propose a heuristic method – based on the Greedy Randomized Adaptive Search Procedure, GRASP, methodology – for finding approximate solutions to this optimization problem. In particular, we consider an advanced GRASP design in which a filtering mechanism avoids applying the local search method to low quality constructed solutions. Empirical results indicate that the proposed implementation compares favorably to previous methods. This fact is confirmed with non-parametric statistical tests.