Sánchez-Oro, JesúsLópez Sánchez, Ana DoloresColmenar, José Manuel2025-01-202025-01-202021-01-02Sá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-010.1007/s11590-020-01690-0https://hdl.handle.net/10433/22478Researchers 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.application/pdfenFacility location problemObnoxious p-median problemMulti-objective optimizationVariable neighborhood searchjournal articlerestricted access