Article ID: | iaor20012670 |
Country: | United States |
Volume: | 35 |
Issue: | 3/4 |
Start Page Number: | 527 |
End Page Number: | 530 |
Publication Date: | Dec 1998 |
Journal: | Computers & Industrial Engineering |
Authors: | Shayan E., Tavakkoli-Moghaddain R. |
Keywords: | layout, genetic algorithms |
Genetic algorithms (GAs) are a class of adaptive search techniques which have gained popularity in optimisation. In particular they have successfully been applied to NP hard problems such as those related to mathematical modelling of facilities design problems. The typical steps required to implement GAs are: encoding of feasible solutions into chromosomes using a representation method, evaluation of fitness function, setting of GAs parameters, selection strategy, genetic operators, and criteria to terminate the process. This paper reports on finding of a research in design of a GA solving the quadratic assignment formulation of equal and unequal-sized facilities layout problems. Comparison is made with solutions of several test problems reported in the literature.