DocumentCode :
982850
Title :
Efficient chromosome encoding and problem-specific mutation methods for the flexible bay facility layout problem
Author :
Eklund, Neil H W ; Embrechts, Mark J. ; Goetschalckx, Marc
Author_Institution :
GE Global Res. Center, Ind. Artificial Intelligence Lab., Niskayuna, NY
Volume :
36
Issue :
4
fYear :
2006
fDate :
7/1/2006 12:00:00 AM
Firstpage :
495
Lastpage :
502
Abstract :
Two chromosome encoding methods are compared for finding solutions to the nondeterministic polynomial-time hard flexible bay facilities layout problem via genetic algorithm (GA). Both methods capitalize on the random key GA approach to produce chromosomes that are viable for any combination of allele values. In addition, the effect of four problem-specific mutation methods is assessed for one of the encoding methods. The novel mutation methods are shown to have a substantial effect on performance. Optimal GA parameter settings for the problem-specific mutation methods are found empirically
Keywords :
computational complexity; encoding; facilities layout; genetic algorithms; chromosome encoding method; flexible bay facility layout problem; genetic algorithm; nondeterministic polynomial-time hard layout problem; problem-specific mutation method; Biological cells; Encoding; Genetic algorithms; Genetic mutations; Helium; NP-hard problem; Shape; Systems engineering and theory; Transportation; Very large scale integration; Facility layout; flexible bay; genetic algorithms (GAs); problem-specific mutations;
fLanguage :
English
Journal_Title :
Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on
Publisher :
ieee
ISSN :
1094-6977
Type :
jour
DOI :
10.1109/TSMCC.2006.875412
Filename :
1643840
Link To Document :
بازگشت