Software Implementation and Experimentation with a New Genetic Algorithm for Layout Design

Document Type : Research Paper


Department of Operations Management, Kazakhstan Institute f Management, Economics and Strategic Research (KIMEP), 4 Abai St , Almaty, Kazakhstan


This paper discusses the development of a new GA for layout design. The GA was already designed and reported. However the implementation used in the earlier work was rudimentary and cumbersome, having no suitable Graphical User Interface, GUI. This paper discusses the intricacies of the algorithm and the GA operators used in previous work. It also reports on implementation of a new GA operator which was not included in earlier reports. The software was then used to conduct a series of experimentations to establish the best configuration of the operators for better results. The paper is also demonstrating a comparison of the new GA results and results from the literature. In addition the results show the solution of two new problems by various methods from the author’s own layout developments in industry. The results demonstrate that in most cases the new GA is superior to the existing methods. In particular the speed of the new GA is achieving a reasonable solution is significantly low.


Main Subjects

1] Bazaraa M.S. (1975), Computational Layout Design: a branch-and-bound approach, AIIE Transactions
7(4); 432-438.
[2] Bazaraa M.S., Kirca O. (1983), A Branch-and-bound heuristic to solve QAP; Naval research logistics
quarterly 30; 287-304.
[3] Bazaraa M.S., Sherali M.D. (1980), Benders' partitioning scheme applied to a new formulation of
Quadratic Assignment Problem; Naval Research logistic quarterly 27(1); 29-41.
[4] Chittallappilly A. (2003), A Genetic Algorithm with two-dimensional chromosomes for Facility
Layout; Swinburne University of Technology.
[5] Francis R.L., McGinnis L.F, White J.A. (1992), Facility Layout and Location: An Analytical
Approach; Prentice-Hall, Englewood Cliffs, NJ.
[6] Gero J.S., Kazakov V. (1997), Learning and reusing information in space layout planning problems
using genetic engineering; Artificial Intelligence Engineering 11(4); 329–334.
[7] Gorey M.R., Johnson D.S. (1979), Computers and intractability: a guide to the theory of NPcompleteness;
W. H. Freeman, New York.
[8] Hanafi R. (2000), Design of a Genetic Algorithm to solve the Facility Layout problem; Swinburne
University of Technology, Melbourne, unpublished dissertation.
[9] Holland J. (1975), Adaptation in Natural and Artificial Systems; Ann Arbor, The University of
Michigan Press.
[10] Imam M.H., Mir M. (1993), Automated layout of facilities of unequal areas; Computers and Industrial
Engineering 24(3); 355-366.
[11] Kusiak A., Heragu S.S. (1987), The facility layout problem; European Journal of Operations Research
29; 229–251.
[12] Moghaddam R.T. (1997), Design of a genetic algorithm to solve manufacturing facilities layout
problem; Swinburne University of Technology, Melbourne, dissertation.
[13] Moghaddam R.T., Shayan E. (1998), Facility layout design by genetic algorithm; International
Journal of computers and Industrial Engineering 35(3-4); 527-530.
[14] Pinto Wilsten J. , Shayan E. (2007), Layout Design of a Furniture Production Line Using Formal
Methods, Journal of Industrial and Systems Engineering 1(1); 81-96.
[15] Shayan E., Al-Hakim L. (1999), Cloning in layout design problem: A genetic algorithm approach;
Proceedings of the 15th International Conference on Production Research (Hillery M., Lewis, H.
Eds.); University of Limerick, Ireland; 787-792.
[16] Shayan E., Chittilappilly A. (2004), Genetic algorithm for facilities layout problems based on slicing
tree structure; International Journal of Production Research 42(19); 4055-4067.
[17] Suresh G., Vinod V.V, Sahu S. (1995), A genetic algorithm for facility layout; International Journal of
Production Research 33; 3411-23.
[18] Tam K.Y. (1992), A simulated annealing algorithm for allocating space to manufacturing cells;
International Journal of Production Research 30(1); 63–87.
[19] Tam K.Y. (1992), Genetic algorithm, function optimization, and facility layout design; European
Journal of Operational Research 63; 322–346.
[20] Tam K.Y., Chan D.K. (1998), Solving facility layout problems with geometric constraints using
parallel genetic algorithms: experimentation and findings; International Journal of Production
Research 36(12); 3253–3272.
[21] Tate David M., Smith Alice E. (1995), A Genetic Approach to the Quadratic Assignment Problem;
Computers and Operations Research 22(1); 73-83.
[22] Tompkins James A., White John A., Bozer Yavuz A. (1996), Facilities Planning, 2nd Edition; John
Wiley & Sons Canada, Ltd
[23] Wang Rong-Long, Okazaki Kozo (2004), Solving Facility Layout Problem Using an Improved
Genetic Algorithm; ICICE transactions.
[24] Zhang L., Zhang B. (1999), A Geometrical Representation of McCulloch-Pitts Neural Model and Its
Applications; IEEE Transactions on Neural Networks 10(4); 291-295.
  • Receive Date: 13 March 2008
  • Revise Date: 20 September 2008
  • Accept Date: 08 March 2009
  • First Publish Date: 01 July 2009