An efficient algorithm for facility location in the presence of forbidden regions
An efficient algorithm for facility location in the presence of forbidden regions
复制标题
存在禁区的情况下设施定位的有效算法
DOI：
10.1016/0377-2217(94)00297-5
复制
发表时间：
1996
影响因子：
6.4
通讯作者：
T. M. Cavalier
中科院分区：
文献类型：
--
作者：
Steven E. Butt;T. M. Cavalier
本文研究了经典Weber问题的一种约束形式。具体地说，我们考虑了在存在凸多边形禁区的情况下选址新设施的问题，使得新设施到n个现有设施的加权距离之和最小。假设禁止区域是平面上不允许旅行和设施位置的区域，并且使用欧几里得距离度量来测量距离。给出了该非凸规划问题的一种求解方法。结果表明，通过迭代求解一系列无约束问题，该过程可终止于原约束问题的局部最优解。文中给出了数值算例。
This paper investigates a constrained form of the classical Weber problem. Specifically, we consider the problem of locating a new facility in the presence of convex polygonal forbidden regions such that the sum of the weighted distances from the new facility to n existing facilities is minimized. It is assumed that a forbidden region is an area in the plane where travel and facility location are not permitted and that distance is measured using the Euclidean-distance metric. A solution procedure for this nonconvex programming problem is presented. It is shown that by iteratively solving a series of unconstrained problems, this procedure terminates at a local optimum to the original constrained problem. Numerical examples are presented.