On solving facility layout problems using genetic algorithms

被引:51
作者
Al-Hakim, L [1 ]
机构
[1] Monash Univ, Div Ind Engn & Engn Management, Caulfield, Vic 3145, Australia
关键词
D O I
10.1080/00207540050031922
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Tam and Chan (1998) present a parallel genetic algorithm approach to solve the facility layout problem. They adopt a slicing tree representation of a floor layout. The coding scheme represents a layout as a string with three parts. This paper demonstrates the difficulties in applying classical crossover and mutation operators for solving facility layout problems. The paper modifies the representation of Tam and Chan and introduces a new preserving operation, referred to as transplanting, that manages to produce feasible offspring. It also studies the applicability of other genetic operations such as diagonal crossover and cloning in generating feasible offspring. The paper is written in a note format and the reader may refer to Tam and Chan for more details.
引用
收藏
页码:2573 / 2582
页数:10
相关论文
共 9 条
[1]   A note on 'A genetic algorithm approach for multiple criteria facility layout design' - Discussion [J].
Al-Hakim, L .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (04) :985-989
[2]  
Davidor Y., 1991, P 1 WORKSH FDN GEN A, P23
[3]  
EIBEN AE, 1995, PRACTICAL HDB GENETI, P307
[4]   A genetic algorithm approach for multiple criteria facility layout design [J].
Islier, AA .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1998, 36 (06) :1549-1569
[5]   AN APPROACH TO A PROBLEM IN NETWORK DESIGN USING GENETIC ALGORITHMS [J].
PALMER, CC ;
KERSHENBAUM, A .
NETWORKS, 1995, 26 (03) :151-163
[6]  
SEDGEWICK R, 1996, ANAL ALGORITHM
[7]  
SHAYAN E, 1999, P 15 INT C PROD RES, P787
[8]   Solving facility layout problems with geometric constraints using parallel genetic algorithms: experimentation and findings [J].
Tam, KY ;
Chan, SK .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1998, 36 (12) :3253-3272
[9]  
TAM KY, 1992, EUR J OPER RES, V63, P322, DOI 10.1016/0377-2217(92)90034-7