论文标题
令人讨厌的设施位置：加权需求点的情况
Obnoxious facility location: the case of weighted demand points
论文作者
论文摘要
本文考虑的问题是加权令人讨厌的设施位置在需求点的凸面中。目标函数是最大化设施和一组需求点之间的最小加权距离。提出了三种新的最佳解决方案方法。 “大三角小三角形”全局优化方法的两个变体，以及基于阿波罗尼乌斯圆圈之间的相交点的过程。我们还使用非线性多功能软件SNOPT将结果与多开始方法进行了比较。 1,000个需求点的问题在计算机时间的一秒钟内最佳解决。
The problem considered in this paper is the weighted obnoxious facility location in the convex hull of demand points. The objective function is to maximize the smallest weighted distance between a facility and a set of demand points. Three new optimal solution approaches are proposed. Two variants of the "Big Triangle Small Triangle" global optimization method, and a procedure based on intersection points between Apollonius circles. We also compared the results with a multi-start approach using the non-linear multi-purpose software SNOPT. Problems with 1,000 demand points are optimally solved in a fraction of a second of computer time.
