GRASP with strategic oscillation for the α-neighbor p-center problem

Abstract

This paper presents a competitive algorithm that combines the Greedy Randomized Adaptive Search Pro-cedure including a Tabu Search instead of a traditional Local Search framework, with a Strategic Oscillation post-processing, to provide high-quality solutions for the α-neighbor p-center problem ( α−pCP). This problem seeks to locate pfacilities to service or cover a set of n demand points with the objective of minimizing the maximum distance between each demand point and its αth nearest facility. The algo- rithm is compared to the best method found in the state of the art, which is an extremely efficient exact procedure for the continuous variant of the problem. An extensive comparison shows the relevance of the proposal, being able to provide competitive results independently of the αvalue.