A global optimal approach to facility location in the presence of forbidden regions

被引：35

作者：

McGarvey, RG

Cavalier, TM

机构：

[1] Penn State Univ, Harold & Inge Marcus Dept Ind & Mfg Engn, University Pk, PA 16801 USA

[2] RAND Corp, Pittsburgh, PA 15213 USA

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 2003年 / 45卷 / 01期

关键词：

non-convex optimization; branch-and-bound; location; forbidden regions;

D O I：

10.1016/S0360-8352(03)00028-7

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper addresses the planar 1-median problem with convex polygonal forbidden regions. A new facility is to be located to minimize the sum of weighted distances to a set of existing facilities such that the new facility is not located within any forbidden region, and no travel occurs through forbidden regions. A solution procedure using the 'Big Square Small Square' branch-and-bound method is developed, and used to find a global optimum. (C) 2003 Elsevier Science Ltd. All rights reserved.

引用

页码：1 / 15

页数：15

共 22 条

[1] ALGORITHMS FOR WEBER FACILITY LOCATION IN THE PRESENCE OF FORBIDDEN REGIONS AND OR BARRIERS TO TRAVEL [J].