RT Journal Article
T1 GRASP with strategic oscillation for the α-neighbor p-center problem
A1 Sánchez-Oro, Jesús
A1 López Sánchez, Ana Dolores
A1 Hernández-Díaz, Alfredo G.
A1 Duarte, Abraham
K1 Metaheuristics
K1 GRASP
K1 Tabu search
K1 Strategic oscillation
K1 p-Center Problem
AB 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.
PB Elsevier
YR 2022
FD 2022-11-16
LK https://hdl.handle.net/10433/22475
UL https://hdl.handle.net/10433/22475
LA en
NO J. Sánchez-Oro, A.D. López-Sánchez, A.G. Hernández-Díaz, A. Duarte, GRASP with strategic oscillation for the α-neighbor p-center problem, European Journal of Operational Research, Volume 303, Issue 1, 2022, Pages 143-158, ISSN 0377-2217, https://doi.org/10.1016/j.ejor.2022.02.038.
NO Departamento de Economía, Métodos cuantitativos e Historia Económica. Universidad Pablo de Olavide.
DS RIO
RD May 9, 2026