A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem
This paper deals with an interesting facility location problem known as the bi-objective p-Median and p-Dispersion problem (BpMD problem). The BpMD problem 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.
Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. J. Sánchez-Oro, A. Duarte and I. Lozano-Osorio acknowledge the support from the Spanish Ministry of “Ciencia, Innovación y Universidades” (MCIN/AEI/10.13039/501100011033/FEDER, UE) under grant ref. PID2021-126605NB-I00 and PID2021-125709OA-C22, the “Comunidad de Madrid” and “Fondos Estructurales” of the European Union with grant reference S2018/TCS-4566. A.D. López-Sánchez acknowledges support from the Spanish Ministry of “Economía, Industria y Competitividad” through Projects PID2019-104263RB-C41, and from Junta de Andalucía, FEDER-UPO Research & Development Call, reference number UPO-1263769.
- Artículos de Revista