RT Journal Article
T1 GRASP and VNS for solving the p-next center problem
A1 López Sánchez, Ana Dolores
A1 Sánchez-Oro, Jesús
A1 Hernández-Díaz, Alfredo G.
K1 Discrete location
K1 p-center problem
K1 p-next center problem
K1 GRASP
K1 VNS
AB This paper presents two metaheuristic algorithms for the solution of the p-next center problem: a Greedy Randomized Adaptive Search Procedure and a Variable Neighborhood Search algorithm, that will be sub- sequently hybridized. The p -next center problem is a variation of the p-center problem, which consists of locating p out of n centers and assigning them to users in order to minimize the maximum, over all users, of the distance of each user to its corresponding center plus the distance between this center to its closest alternative center. This problem emerges from the need to reach a secondary help center in the case of a natural disaster, when the closest center may become unavailable.
PB Elsevier
YR 2018
FD 2018-12-21
LK https://hdl.handle.net/10433/22476
UL https://hdl.handle.net/10433/22476
LA en
NO A.D. López-Sánchez, J. Sánchez-Oro, A.G. Hernández-Díaz, GRASP and VNS for solving the p-next center problem, Computers & Operations Research, Volume 104, 2019, Pages 295-303, ISSN 0305-0548, https://doi.org/10.1016/j.cor.2018.12.017.
NO Departamento de Economía, Métodos cuantitativos e Historia Económica. Universidad Pablo de Olavide.
DS RIO
RD May 9, 2026