Solving multiple facilities location problems with separated clusters

被引：4
|
作者：
Brimberg, Jack [1 ]
Drezner, Zvi [2 ]
机构：
[1] Royal Mil Coll Canada, Dept Math & Comp Sci, Kingston, ON, Canada
[2] Calif State Univ Fullerton, Steven G Mihaylo Coll Business & Econ, Fullerton, CA 92834 USA
来源：
OPERATIONS RESEARCH LETTERS | 2019年 / 47卷 / 05期
关键词：
p-median; p-center; Clusters; Dynamic programming; Heuristics; ALGORITHMIC APPROACH; ALLOCATION PROBLEMS;
D O I：
10.1016/j.orl.2019.07.007
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper examines a special case of multi-facility location problems where the set of demand points is partitioned into a given number of subsets or clusters that can be treated as smaller independent sub-problems once the number of facilities allocated to each cluster is determined. A dynamic programming approach is developed to determine the optimal allocation of facilities to clusters. The use of clusters is presented as a new idea for designing heuristics to solve general multi-facility location problems. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码：386 / 390
页数：5
相关论文
共 50 条
12345