Skeleton-based facility layout design using genetic algorithms

被引:7
作者
Delmaire, H [1 ]
Langevin, A [1 ]
Riopel, D [1 ]
机构
[1] ECOLE POLYTECH, DEPT MATH & GENIE IND, MONTREAL, PQ H3C 3A7, CANADA
关键词
optimization; facility layout; genetic algorithms; linear programming;
D O I
10.1023/A:1018905701035
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, a new approach for the facility layout problem is presented. This approach combines genetic algorithms with linear programming to design the facilities on fixed aisle skeletons (spine shape, T shape, etc.). For a given shape, a string in the genetic process gives the ordering of the departments. This ordering is used as input for a linear program that computes the fitness of that string as a potential solution to the problem. The genetic search then loops with its operators (selection, cross-over, mutation) correctly adapted. Some tests on problems taken in the literature are reported.
引用
收藏
页码:85 / 104
页数:20
相关论文
共 15 条
[1]   AN INTEGRATED APPROACH TO FACILITIES LAYOUT USING EXPERT SYSTEMS [J].
ABDOU, G ;
DUTTA, SP .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1990, 28 (04) :685-708
[2]  
BANERJEE P, 1992, 9266 U LAV
[3]  
DELMAIRE H, 1995, G9524 GERAD
[4]  
DELMAIRE H, 1995, G9509 GERAD
[5]  
HARMONOSKY CM, 1991, INT J PROD RES, V29, P1263
[6]   EXPERIMENTAL-ANALYSIS OF SIMULATED ANNEALING BASED ALGORITHMS FOR THE LAYOUT PROBLEM [J].
HERAGU, SS ;
ALFA, AS .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 57 (02) :190-202
[7]  
Holland J. H., 1975, Adaptation in natural and artificial system, DOI DOI 10.7551/MITPRESS/1090.001.0001
[8]   COMPUTER-AIDED FACILITY LAYOUT - AN INTERACTIVE MULTI-GOAL APPROACH [J].
HOUSHYAR, A .
COMPUTERS & INDUSTRIAL ENGINEERING, 1991, 20 (02) :177-186
[9]   THE FACILITY LAYOUT PROBLEM [J].
KUSIAK, A ;
HERAGU, SS .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 29 (03) :229-251
[10]   SPINE LAYOUT DESIGN [J].
LANGEVIN, A ;
MONTREUIL, B ;
RIOPEL, D .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1994, 32 (02) :429-442