论文标题
令人讨厌的设施Planar P-Median问题
The obnoxious facilities planar p-median problem
论文作者
论文摘要
在本文中，我们提出了平面令人讨厌的P-Median问题。在P-Median问题中，目的是为设施找到P位置，以最大程度地减少需求点与其最接近设施之间的距离。在令人讨厌的版本中，我们添加了约束，即每个设施必须至少与部分需求点相距一定距离，因为它们会产生影响这些需求点的滋扰。由此产生的问题是极其非凸，传统的非线性求解器（例如SNOPT）并非有效。提出并测试了一种基于Voronoi图的有效解决方案方法。我们还构建了测试问题的有效边界，以帮助刨床做出位置决策。
In this paper we propose the planar obnoxious p-median problem. In the p-median problem the objective is to find p locations for facilities that minimize the weighted sum of distances between demand points and their closest facility. In the obnoxious version we add constraints that each facility must be located at least a certain distance from a partial set of demand points because they generate nuisance affecting these demand points. The resulting problem is extremely non-convex and traditional non-linear solvers such as SNOPT are not efficient. An efficient solution method based on Voronoi diagrams is proposed and tested. We also constructed the efficient frontiers of the test problems to assist the planers in making location decisions.
