A LAGRANGEAN APPROACH TO THE FACILITY LOCATION PROBLEM WITH CONCAVE COSTS

被引：3
|
作者：
KUBO, M [1 ]
KASUGAI, H [1 ]
机构：
[1] WASEDA UNIV,DEPT IND ENGN & MANAGEMENT,TOKYO 169,JAPAN
来源：
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN | 1991年 / 34卷 / 02期
关键词：
D O I：
10.15807/jorsj.34.125
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider the concave cost capacitated facility location problem, and develop a composite algorithm of lower and upper bounding procedures. Computational results for several instances with up to 100 customers and 25 candidate facility locations are also presented. Our numerical experiments show that the proposed algorithm generates good solutions. The gaps between upper and lower bounds are within 1 percent for all test problems.
引用
收藏
页码：125 / 136
页数：12
相关论文
共 50 条
12345