A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem

In today's market conditions of increasing global competition, rapid changes in technology and shorter life cycle of product, it is required to evaluate the facility layout as the dynamic facility layout problem (DFLP). The objective of the DFLP is to determine layouts for each period in the planning horizon such that the sum of material handling and rearrangement costs are minimised. In the literature several researchers proposed new algorithms and models to solve the problem. The purpose of this research is to present a new hybrid heuristic based on the simulated annealing (SA) approach supplemented with a tabu list for the DFLP. We call this heuristic TABUSA. The efficiency of the TABUSA algorithm is analysed by solving the problems in a well known data set from the literature. We have also solved the same problems by using a pure SA algorithm, and a pure tabu search (TS) algorithm for comparison purposes. The results show the effectiveness of the TABUSA algorithm.

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

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

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

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

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

[6]  Geoffrey C. Fox,et al.  A Comparison of Annealing Techniques for Academic Course Scheduling , 1997, PATAT.

[7]  Manoj Kumar Tiwari,et al.  Modeling machine loading problem of FMSs and its solution methodology using a hybrid tabu search and , 2004 .

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

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

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

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

[12]  José M. Rodríguez,et al.  Solving the Dynamic Plant Layout Problem using a new hybrid meta-heuristic algorithm , 2006, Int. J. High Perform. Comput. Netw..

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

[14]  De-fu Zhang,et al.  An effective hybrid algorithm for the problem of packing circles into a larger containing circle , 2005, Comput. Oper. Res..

[15]  Ismail Karaoglan,et al.  An adaptive tabu-simulated annealing for concave cost transportation problems , 2008, J. Oper. Res. Soc..

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

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

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

[19]  S. Zolfaghari,et al.  Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach , 1999 .

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

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

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

[23]  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..

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

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