GENETIC SEARCH AND THE DYNAMIC FACILITY LAYOUT PROBLEM

被引：92

作者：

CONWAY, DG ^{[1
]}

VENKATARAMANAN, MA ^{[1
]}

机构：

[1] INDIANA UNIV,SCH BUSINESS,BLOOMINGTON,IN 47405

来源：

COMPUTERS & OPERATIONS RESEARCH | 1994年 / 21卷 / 08期

关键词：

Genetic search - Multiperiod facility layout problem;

D O I：

10.1016/0305-0548(94)90023-X

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This research examines the suitability of genetic algorithms to the problem of facility layout over time. Genetic algorithms use the principles of genetics to evolve an initial population of solutions into a population of superior solutions. One advantage of this approach is its ability to include multiple constraints as well as non-linear and non-convex objective functions. We present a genetic procedure for the multi-period facility layout problem and report results for two test problems.

引用

页码：955 / 960

页数：6

共 7 条

[1] [Anonymous], 1987, GENETIC ALGORITHMS S
[2] BALAKRISHNAN J, EUROPEAN J OPERATION
[3] Goldberg DE, 1989, GENETIC ALGORITHMS S
[4] THE FACILITY LAYOUT PROBLEM
KUSIAK, A
HERAGU, SS
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 29 (03) : 229 - 251
[5] Raghavan V. V., 1987, Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, P241
[6] ROSENBERG RS, 1967, DISS ABSTR INT, V28
[7] THE DYNAMICS OF PLANT LAYOUT
ROSENBLATT, MJ
[J]. MANAGEMENT SCIENCE, 1986, 32 (01) : 76 - 86

← 1 →