Solving facility layout problems with strict geometric constraints using a two-phase genetic algorithm

This article puts forward a two-phase genetic algorithm that is able to solve facility layout problems strictly respecting the geometric constraints imposed on activities. In the first phase the algorithm attempts to locate an optimum slicing tree to group the activities appropriately. In the second phase the layout is obtained from this tree. In order to assess the slicing trees in the first phase we propose an evaluation function able to predict if, by making the appropriate cuts, the tree structure is able to generate layouts that satisfy the geometric restrictions imposed on the facilities to be arranged, and to minimize the cost of transporting materials between the production activities. It also permits the determination of the most suitable aspect ratio of the layout zone in order to minimize non-compliance with the geometric restrictions. The algorithm and the method of calculating the indicator proposed in the evaluation function are described, and the results obtained in the experiments carried out are also given.

[1]  Elwood S. Buffa,et al.  A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[2]  Roger C. Vergin,et al.  Comparison of Computer Algorithms and Visual Based Methods for Plant Layout , 1975 .

[3]  Reuven R. Levary,et al.  Facilities layout. A survey of solution procedures , 1985 .

[4]  Andrew Kusiak,et al.  The facility layout problem , 1987 .

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  A. H. Redford.  Materials handling for general purpose assembly , 1991 .

[7]  K. Tam,et al.  A hierarchical approach to the facility layout problem , 1991 .

[8]  Donald E. Brown,et al.  A parallel heuristic for quadratic assignment problems , 1989, Comput. Oper. Res..

[9]  K. Y. Tam,et al.  A simulated annealing algorithm for allocating space to manufacturing cells , 1992 .

[10]  K. Y. Tam,et al.  Genetic algorithms, function optimization, and facility layout design , 1992 .

[11]  Munirpallam A. Venkataramanan,et al.  Genetic search and the dynamic facility layout problem , 1994, Comput. Oper. Res..

[12]  Alice E. Smith,et al.  Unequal-area facility layout by genetic search , 1995 .

[13]  Yeong-Dae Kim,et al.  A space partitioning method for facility layout problemswith shape constraints , 1998 .

[14]  Kar Yan Tam,et al.  Solving facility layout problems with geometric constraints using parallel genetic algorithms: Experimentation and findings , 1998 .

[15]  K.-Y. Gau,et al.  An iterative facility layout algorithm , 1999 .

[16]  L. A. Al-Hakim,et al.  On solving facility layout problems using genetic algorithms , 2000 .

[17]  Y. Wu,et al.  The optimisation of block layout and aisle structure by a genetic algorithm , 2002 .

[18]  Kin Keung Lai,et al.  A class of genetic algorithms for multiple-level warehouse layout problems , 2002 .

[19]  Kam-Fai Wong,et al.  FACOPT: a user friendly FACility layout OPTimization system , 2003, Comput. Oper. Res..

[20]  E. Shayan *,et al.  Genetic algorithm for facilities layout problems based on slicing tree structure , 2004 .

[21]  Michael H. Hu,et al.  A solution to the unequal area facilities layout problem by genetic algorithm , 2005, Comput. Ind..

[22]  Jose Antonio Diego-Mas,et al.  Slicing tree's geometric potential: an indicator for layout problems based on slicing tree structure , 2008 .