Solving the Dynamic Plant Layout Problem using a new hybrid meta-heuristic algorithm

The Quadratic Assignment Problem (QAP) can be used to formulate the Facility Layout Problem (FLP). The Dynamic Plant Layout Problem (DPLP) extends the FLP. Of the attempted 48 DPLP instances, 29 now have new best-known solution. With respect to the six department instances that all have a known optimal solution, optimal solutions were obtained for two, for which no heuristic had been found before, and previously found optimal solutions were matched for the remainder. With respect to the 15 and 30 department instances, none of which has a known optimal solution, only three current best-known solutions could not be obtained.

[1]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

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

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

[4]  Adil Baykasoglu,et al.  A simulated annealing algorithm for dynamic layout problem , 2001, Comput. Oper. Res..

[5]  Ali M. S. Zalzala,et al.  Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons , 2000, IEEE Trans. Evol. Comput..

[6]  Timothy L. Urban.  A HEURISTIC FOR THE DYNAMIC FACILITY LAYOUT PROBLEM , 1993 .

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

[8]  M. Venkataramanan,et al.  SOLUTIONS FOR THE CONSTRAINED DYNAMIC FACILITY LAYOUT PROBLEM , 1992 .

[9]  José M. Rodríguez,et al.  Solving the Quadratic Assignment and Dynamic Plant Layout Problems Using a New Hybrid Meta-Heuristic Approach , 2004, HPCS.

[10]  Jay B. Ghosh,et al.  New heuristic for the dynamic layout problem , 2003, J. Oper. Res. Soc..

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

[12]  Adil Baykasoglu,et al.  Erratum to "A simulated annealing algorithm for dynamic layout problem": [Computers & Operations Research 28 (2001) 1367-1460] , 2004, Comput. Oper. Res..

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

[14]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[15]  Chun Hung Cheng,et al.  A hybrid genetic algorithm for the dynamic plant layout problem , 2003 .

[16]  Eranda Çela,et al.  The quadratic assignment problem : theory and algorithms , 1999 .

[17]  Panos M. Pardalos,et al.  The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.

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

[19]  Chun Hung Cheng,et al.  Genetic search and the dynamic layout problem , 2000, Comput. Oper. Res..

[20]  Leon F. McGinnis,et al.  Facility Layout and Location: An Analytical Approach , 1991 .