RT Journal Article
T1 A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
A1 Sánchez-Oro, Jesús
A1 López Sánchez, Ana Dolores
A1 Colmenar, José Manuel
K1 Facility location problem
K1 Obnoxious p-median problem
K1 Multi-objective optimization
K1 Variable neighborhood search
AB Researchers and practitioners have addressed many variants of facility locations problems. Each location problem can be substantially different from each other depending on the objectives and/or constraints considered. In this paper, the bi-objective obnoxious p-median problem (Bi-OpM) is addressed given the huge interest to locate facilities such as waste or hazardous disposal facilities, nuclear power or chemical plants and noisy or polluting services, among others. The Bi-OpM aims to locate p facilities maximizing two different objectives: the distance between each customer and their nearest facility center and the dispersion among facilities. To address the Bi-OpM problem a Multi-objective Parallel Variable Neighborhood Search approach (Mo-PVNS) is implemented. Computational results indicate the superiority of the Mo-PVNS compared to the state-of-art algorithms.
PB Springer
YR 2021
FD 2021-01-02
LK https://hdl.handle.net/10433/22478
UL https://hdl.handle.net/10433/22478
LA en
NO Sánchez-Oro, J., López-Sánchez, A.D. & Colmenar, J.M. A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem. Optim Lett 16, 301–331 (2022). https://doi.org/10.1007/s11590-020-01690-0
NO Departamento de Economía, Métodos cuantitativos e Historia Económica. Universidad Pablo de Olavide.
DS RIO
RD May 8, 2026