Iterated Great Deluge for the Dynamic Facility Layout Problem

This chapter introduces an iterated great deluge (IGD) heuristic for the dynamic facility layout problem (DFLP). This problem involves the arrangement of manufacturing facilities over time to minimize the sum of the material handling and rearrangement costs. The IGD heuristic combines a great deluge algorithm with a perturbation operator that helps escape from local optima. Our implementation of the IGD heuristic relies on two main steps: (i) we first generate a local optimum solution by running an extended great deluge (EGD) algorithm for N1 iterations; (ii) the second step consists in a loop that perturbs the best current solution, and restarts an improvement by running the EGD algorithm for N2 < N1 iterations. Numerical results for 48 test problems from previous research are reported and compared. The solutions found by our approach are very competitive and a great set of the obtained results are better than or are at par with the well-known best solutions. New solutions (i.e., solutions better than the best solutions existing until now in the DFLP literature) are obtained in 13 problems. The newly developed IGD heuristic is discussed in the context of the general iterated local search paradigm.

[1]  RelaxationsNathan W. Brixius,et al.  Solving Quadratic Assignment Problems UsingConvex Quadratic Programming , 2000 .

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

[3]  J. A. Bland.  LAYOUT OF FACILITIES USING AN ANT SYSTEM APPROACH , 1999 .

[4]  Daoud Aït-Kadi,et al.  Coupling ant colony and the degraded ceiling algorithm for the redundancy allocation problem of series-parallel systems , 2007, Reliab. Eng. Syst. Saf..

[5]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.

[6]  Ravi Shankar,et al.  Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing , 2004, Eur. J. Oper. Res..

[7]  Mohammad Saidi-Mehrabad,et al.  An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem , 2009 .

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

[9]  Randolph Sloof,et al.  An Experimental Comparison , 2016 .

[10]  Alan R. McKendall.  Improved Tabu search heuristics for the dynamic space allocation problem , 2008, Comput. Oper. Res..

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

[12]  Gilbert Laporte,et al.  Iterated tabu search for the car sequencing problem , 2008, Eur. J. Oper. Res..

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

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

[15]  Alice E. Smith,et al.  A genetic approach to the quadratic assignment problem , 1995, Comput. Oper. Res..

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

[17]  A. Alfa,et al.  Experimental analysis of simulated annealing based algorithms for the layout problem , 1992 .

[18]  G. Dueck.  New optimization heuristics , 1993 .

[19]  E. Baum.  Towards practical `neural' computation for combinatorial optimization problems , 1987 .

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

[21]  David Connolly.  An improved annealing scheme for the QAP , 1990 .

[22]  Gülfem Tuzkaya,et al.  A comparative analysis of meta-heuristic approaches for facility layout design problem: a case study for an elevator manufacturer , 2013, J. Intell. Manuf..

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

[24]  Chun Hung Cheng,et al.  The dynamic plant layout problem : Incorporating rolling horizons and forecast uncertainty , 2009 .

[25]  Corso Elvezia.  Ant Colonies for the QAP , 1997 .

[26]  Thomas Sttzle,et al.  Applying iterated local search to the permutation ow shop problem , 1998 .

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

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

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

[30]  Sanja Petrovic,et al.  A time-predefined local search approach to exam timetabling problems , 2004 .

[31]  Thomas Stützle,et al.  A beginner's introduction to iterated local search , 2001 .

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

[33]  K. C. Chan,et al.  A study of genetic crossover operations on the facilities layout problem , 1994 .

[34]  G. Dueck,et al.  Record Breaking Optimization Results Using the Ruin and Recreate Principle , 2000 .

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

[36]  Mario Enea,et al.  The facility layout problem approached using a fuzzy model and a genetic search , 2005, J. Intell. Manuf..

[37]  J. A. Bland.  Space-planning by ant colony optimisation , 1999 .

[38]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

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

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

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

[42]  Thomas Stützle,et al.  Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..

[43]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[44]  J. Driscoll,et al.  A computer model for investigating the relayout of batch production areas , 1985 .

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

[46]  Shahin Gelareh,et al.  A Survey of Meta-Heuristic Solution Methods for the Quadratic Assignment Problem , 2007 .

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

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

[49]  Mário Mestria,et al.  Metaheuristic methods for a class of the facility layout problem , 2000, J. Intell. Manuf..

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

[51]  V. Cung,et al.  A scatter search based approach for the quadratic assignment problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

[53]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[54]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[55]  Mustapha Nourelfath,et al.  A new approach for buffer allocation in unreliable production lines , 2006 .

[56]  Benoit Montreuil,et al.  Coupling ant colony optimization and the extended great deluge algorithm for the discrete facility layout problem , 2007 .

[57]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[58]  Alfonsas Misevicius,et al.  ITERATED TABU SEARCH: AN IMPROVEMENT TO STANDARD TABU SEARCH , 2015 .

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

[60]  H. Sherali,et al.  Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem , 1980 .

[61]  Jeff T. Linderoth,et al.  Solving large quadratic assignment problems on computational grids , 2002, Math. Program..

[62]  S. Rahman.  Reliability Engineering and System Safety , 2011 .

[63]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems: analysis, algorithms, and new applications , 1999 .

[64]  Stefan Voß,et al.  A Star-Shaped Diversification Approach in Tabu Search , 1996 .

[65]  Alfonsas Misevičius,et al.  USING ITERATED TABU SEARCH FOR THE TRAVELING SALESMAN PROBLEM , 2015 .

[66]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..