RT Journal Article
T1 A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem
A1 Lozano Osorio, Isaac
A1 Sánchez-Oro, Jesús
A1 López Sánchez, Ana Dolores
A1 Duarte, Abraham
K1 Multi-objective combinatorial optimization problems
K1 p-Median problem
K1 p-Dispersion problem
K1 Reactive path relinking
AB This paper deals with an interesting facility location problem known as the bi-objective p-Median and p-Dispersion problem (BpMDproblem). TheBpMDproblem seeks to locate p facilities to service a set of n demand points, and the goal is to minimize the total distance between facilities and demand points and, simultaneously, maximize the minimum distance between all pairs of hosted facilities. The problem is addressed with a novel path relinking approach, called reactive path relinking, which hybridizes two of the most extended path relinking variants: interior path relinking and exterior path relinking. Additionally, the proposal is adapted to a multi-objective perspective for finding a good approximation of the Pareto front. Computational results prove the superiority of the proposed algorithm over the best procedures found in the literature.
PB Springer
YR 2023
FD 2023-03-31
LK https://hdl.handle.net/10433/22473
UL https://hdl.handle.net/10433/22473
LA en
NO Lozano-Osorio, I., Sánchez-Oro, J., López-Sánchez, A.D. et al. A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem. Soft Comput 27, 8029–8059 (2023). https://doi.org/10.1007/s00500-023-07994-4
NO Departamento de Economía, Métodos cuantitativos e Historia Económica. Universidad Pablo de Olavide.
DS RIO
RD May 30, 2026