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.

研究人员和从业人员解决了设施位置问题的许多变体。取决于所考虑的目标和/或约束，每个位置问题可能彼此根本不同。在本文中，鉴于对定位废物或危险处置设施，核电站或化工厂以及嘈杂或污染服务等设施的巨大兴趣，解决了双目标令人讨厌的p中值问题（Bi-OpM）。该双OPM的目的是找到p设施最大化两个不同的目标：每个客户和他们最近的设施中心和设施中的分散之间的距离。解决Bi-OpM问题实现了多目标并行可变邻域搜索方法（Mo-PVNS）。计算结果表明，与最新算法相比，Mo-PVNS具有优越性。