By Topic

Efficient chromosome encoding and problem-specific mutation methods for the flexible bay facility layout problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Eklund, N.H.W. ; GE Global Res. Center, Ind. Artificial Intelligence Lab., Niskayuna, NY ; Embrechts, M.J. ; Goetschalckx, M.

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

Published in:

Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on  (Volume:36 ,  Issue: 4 )