Article ID: | iaor1996709 |
Country: | Netherlands |
Volume: | 63 |
Issue: | 2 |
Start Page Number: | 322 |
End Page Number: | 346 |
Publication Date: | Dec 1992 |
Journal: | European Journal of Operational Research |
Authors: | Tam Kar Yan |
Keywords: | programming: integer, artificial intelligence |
The use of genetic algorithms to solve function optimization probelms requires a coding scheme that represents solutions as strings of finite length. In this paper, a coding scheme designed for facility layout is presented. A solution is represented by the postorder sequence of the nodes in a slicing tree. New solutions are generated by applying the various genetic operators in each generation. The genetic algorithm approach is compared with a local search technique in solving problems with sizes ranging from 12 to 30 facilities. The results demonstrate that a genetic algorithm can be a viable tool to solve large scale layout problems.