Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 252, Issue 2, Pages 432-442Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2016.01.047
Keywords
Obnoxious location; Diversity problem; Metaheuristics; GRASP; Filter solutions
Funding
- [TIN2015-65460-C2]
Ask authors/readers for more resources
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. (C) 2016 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available