Heuristics for the dynamic facility layout problem with unequal-area departments

The dynamic facility layout problem (DFLP) is the problem of finding positions of departments on the plant floor for multiple periods (material flows between departments change during the planning horizon) such that departments do not overlap, and the sum of the material handling and rearrangement costs is minimized. In this paper, the departments may have unequal-areas and free orientations, and the layout for each period is generated on the continuous plant floor. Because of the complexity of the problem, only small-size problems can be solved in reasonable time using exact techniques. As a result, a boundary search (construction) technique, which places departments along the boundaries of already placed departments, is developed for the DFLP. The solution is improved using a tabu search heuristic. The heuristics were tested on some instances from the DFLP and static facility layout problem (SFLP) literature. The results obtained demonstrate the effectiveness of the heuristics.

[1]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[2]  Benoit Montreuil,et al.  A Modelling Framework for Integrating Layout Design and flow Network Design , 1991 .

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

[4]  Joseph B. Mazzola,et al.  A Tabu-Search Heuristic for the Dynamic Plant Layout Problem , 1997, INFORMS J. Comput..

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

[6]  Chun Hung Cheng,et al.  Dynamic layout algorithms: a state-of-the-art survey , 1998 .

[7]  Engelbert Westkämper,et al.  A coevolutionary algorithm for a facility layout problem , 2003 .

[8]  Jadranka Skorin-Kapov,et al.  Extensions of a tabu search adaptation to the quadratic assignment problem , 1994, Comput. Oper. Res..

[9]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[10]  Rrk Sharma,et al.  A review of different approaches to the facility layout problems , 2006 .

[11]  Alan R. McKendall,et al.  Simulated annealing heuristics for the dynamic facility layout problem , 2006, Comput. Oper. Res..

[12]  T. Lacksonen,et al.  Quadratic assignment algorithms for the dynamic layout problem , 1993 .

[13]  Yavuz A. Bozer,et al.  An improvement-type layout algorithm for single and multiple-floor facilities , 1994 .

[14]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[15]  Alan R. McKendall,et al.  Hybrid ant systems for the dynamic facility layout problem , 2006, Comput. Oper. Res..

[16]  Mustahsan Mir,et al.  Cluster boundary search algorithm for building-block layout optimization , 1998 .

[17]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[18]  M. Bazaraa.  Computerized Layout Design: A Branch and Bound Approach , 1975 .

[19]  B. Montreuil,et al.  Dynamic layout design given a scenario tree of probable futures , 1992 .

[20]  Wen-Chyuan Chiang,et al.  Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation , 1998, Eur. J. Oper. Res..

[21]  Meir J. Rosenblatt,et al.  The dynamics of plant layout , 1986 .

[22]  G. Wascher,et al.  A comparative evaluation of heuristics forthe adjacency problem in facility layout planning , 1997 .

[23]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[24]  F. S. Hillier,et al.  Quantitative Tools for Plant Layout Analysis , 1963 .

[25]  Russell D. Meller,et al.  Optimal facility layout design , 1998, Oper. Res. Lett..

[26]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[27]  R. H. Hollier,et al.  Plant layout in practice , 1983 .

[28]  John C. Reynolds,et al.  Reasoning about arrays , 1979, CACM.

[29]  P. Welgama,et al.  Computer-aided facility layout — A status report , 1995 .

[30]  Dana S. Richards,et al.  Distributed genetic algorithms for the floorplan design problem , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[31]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[32]  Mustahsan Mir,et al.  A hybrid optimization approach for layout design of unequal-area facilities , 2001 .

[33]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[34]  Chun Hung Cheng,et al.  An improved pair-wise exchange heuristic for the dynamic plant layout problem , 2000 .

[35]  Taho Yang,et al.  Flexible machine layout design for dynamic and uncertain production environments , 1998, Eur. J. Oper. Res..

[36]  Uday Venkatadri,et al.  Strategic interpolative design of dynamic manufacturing systems layouts , 1991 .

[37]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

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

[39]  P. Moscato.  A Competitive-cooperative Approach to Complex Combinatorial Search , 1991 .

[40]  Hanif D. Sherali,et al.  Enhanced Model Formulations for Optimal Facility Layout , 2003, Oper. Res..

[41]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[42]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[43]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[44]  H. D. Ratliff,et al.  Utilizing Cut Trees as Design Skeletons for Facility Layout , 1989 .

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

[46]  Zvi Drezner,et al.  Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem , 2008, Comput. Oper. Res..

[47]  Sadan Kulturel-Konak,et al.  Approaches to uncertainties in facility layout problems: Perspectives at the beginning of the 21st Century , 2007, J. Intell. Manuf..

[48]  P. S. Welgama,et al.  A construction algorithm for the machine layout problem with fixed pick-up and drop-off points , 1993 .

[49]  G. Hogg,et al.  SHAPE: a construction algorithm for area placement evaluation , 1986 .

[50]  Erhan Kozan,et al.  Ant Colony Optimisation for Machine Layout Problems , 2004, Comput. Optim. Appl..

[51]  Günter Radons,et al.  Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem , 2005, Eur. J. Oper. Res..

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

[53]  Tapio Westerlund,et al.  Optimization of block layout design problems with unequal areas: A comparison of MILP and MINLP optimization methods , 2005, Comput. Chem. Eng..

[54]  Christine L. Valenzuela,et al.  Breeding Normalized Postfix Expressions for the Facility Layout Problem , 2001 .

[55]  Robin S Liggett,et al.  Automated facilities layout: past, present and future , 2000 .

[56]  Mustahsan Mir,et al.  Automated layout of facilities of unequal areas , 1993 .

[57]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

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

[59]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[60]  Hongfei Teng,et al.  An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles , 1999, Eur. J. Oper. Res..

[61]  Marc Goetschalckx,et al.  An interactive layout heuristic based on hexagonal adjacency graphs , 1992 .

[62]  Michel Gendreau,et al.  An Introduction to Tabu Search , 2003, Handbook of Metaheuristics.

[63]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[64]  Alan R. McKendall,et al.  FACILITY LAYOUT OF IRREGULAR-SHAPED DEPARTMENTS USING A NESTED APPROACH , 1999 .

[65]  T. A. Lacksonen.  Preprocessing for static and dynamic facility layout problems , 1997 .

[66]  Panos M. Pardalos,et al.  Quadratic Assignment Problem , 1997, Encyclopedia of Optimization.

[67]  R. C. Lee,et al.  CORELAP: Computerized relationship layout planning , 1967 .

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

[69]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

[70]  Wen-Chyuan Chiang,et al.  An improved tabu search heuristic for solving facility layout design problems , 1996 .

[71]  Otman Basir,et al.  An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization , 2006 .

[72]  R. Burkard,et al.  A heuristic for quadratic Boolean programs with applications to quadratic assignment problems , 1983 .

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

[74]  Yeong-Dae Kim,et al.  Layout planning for facilities with fixed shapes and input and output points , 2000 .

[75]  Sunderesh S. Heragu,et al.  Knowledge based approach to machine cell layout , 1989 .

[76]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[77]  Thomas A. Lacksonen,et al.  Static and Dynamic Layout Problems with Varying Areas , 1994 .

[78]  Zvi Drezner,et al.  A New Genetic Algorithm for the Quadratic Assignment Problem , 2003, INFORMS J. Comput..

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

[80]  Russell D. Meller,et al.  The facility layout problem: Recent and emerging trends and perspectives , 1996 .

[81]  Roger L. Wainwright,et al.  Solving facility layout problems using genetic programming , 1996 .

[82]  Oliver Vornberger,et al.  Hybrid genetic algorithms for constrained placement problems , 1997, IEEE Trans. Evol. Comput..

[83]  Azim Houshyar,et al.  Exact optimal solution for facility layout: deciding which pairs of locations should be adjacent , 1992 .

[84]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

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

[86]  H. D. Ratliff,et al.  GENERATING A LAYOUT FROM A DESIGN SKELETON , 1993 .

[87]  Panos M. Pardalos,et al.  A parallel algorithm for the quadratic assignment problem , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

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

[89]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..