Solving the simple plant location problem by genetic algorithm

被引：107

作者：

Kratica, J

Tosic, D

Filipovic, V

Ljubic, I

机构：

[1] Univ Belgrade, Serbian Acad Sci & Arts, Inst Math, YU-11000 Belgrade, Yugoslavia

[2] Univ Belgrade, Fac Math, YU-11000 Belgrade, Yugoslavia

[3] Inst Comp Graph, Vienna, Austria

来源：

RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH | 2001年 / 35卷 / 01期

关键词：

simple plant location problem; genetic algorithms; combinatorial optimization;

D O I：

10.1051/ro:2001107

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.

引用

页码：127 / 142

页数：16

共 29 条

[1] FACILITY LOCATION MODELS FOR DISTRIBUTION PLANNING [J].