A Data Structure to Significantly Speed up A Simulated Annealing Heuristic for Solving the Dynamic Facility Layout Problem

In this paper a data structure is designed to significantly speed up a simulated annealing heuristic for solving the dynamic facility layout problem (DFLP) existed in literature. The DFLP augments the static facility layout problem (SFLP) to take the flexibility of layout planning into account by considering that the material handling flows between each pair of departments may vary over time periods. Unlike that in the SFLP, the DFLP might require rearranging facility layout over periods to trade off costs between material handling flows and rearranging departments. By companioned the existing simulated annealing heuristic for the DFLP with our designed data structure, the revised version of the algorithm can significantly speeded up the computing time for solving problems, and the data structure can be applied as a useful tool to develop some more efficient solution methods for solving the DFLP related optimization problems in future.

[1]  Orhan Türkbey,et al.  A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem , 2009 .

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

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

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

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

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

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

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

[9]  Hasan Hosseini-Nasab,et al.  A hybrid particle swarm optimisation for dynamic facility layout problem , 2013 .

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

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

[12]  Alan R. McKendall,et al.  New Tabu search heuristics for the dynamic facility layout problem , 2012 .

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

[14]  Berna Haktanirlar Ulutas,et al.  A clonal selection algorithm for dynamic facility layout problems , 2009 .

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

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

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