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

Abstract

This paper presents a competitive algorithm that combines the Greedy Randomized Adaptive Search Procedure 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 -center problem ( CP). This problem seeks to locate facilities to service or cover a set of p demand points with the objective of minimizing the maximum distance between each demand point and its th nearest facility. The algorithm 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.

Cite This Publication

Sánchez-Oro, J., López-Sánchez, A. D., Hernández-Díaz, A. G., & Duarte, A. (2022). GRASP with strategic oscillation for the α-neighbor p-center problem. European Journal of Operational Research, 303(1), 143-158.