A large-scale hybrid simulated annealing algorithm for cyclic facility layout problems

The cyclic facility layout problem (CFLP) is a special case of the dynamic facility layout problem (DFLP) in which there are several production periods and the production cycle repeats itself by going to the first period after the last one because of the seasonal nature of products. In this article, a mixed integer programming formulation is developed for the CFLP. In the DFLP literature, department shapes are assumed to be given or fixed. However, this assumption does not hold in the case of the CFLP because the facility size is limited and the area requirements of the departments change significantly throughout the planning horizon. Therefore, department dimensions and sizes are considered as decision variables in the CFLP. A large-scale hybrid simulated annealing algorithm (LS-HSA) is proposed to solve the formulated problem and shown to be effective and versatile as it can be applied to various facility layout problems.

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

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

[3]  Daniel Scholz,et al.  STaTS: A Slicing Tree and Tabu Search based heuristic for the unequal area facility layout problem , 2009, Eur. J. Oper. Res..

[4]  Timothy L. Urban.  Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem , 1992 .

[5]  Komarudin,et al.  Applying Ant System for solving Unequal Area Facility Layout Problems , 2010, Eur. J. Oper. Res..

[6]  Abdullah Konak,et al.  A new mixed integer programming formulation for facility layout design using flexible bays , 2006, Oper. Res. Lett..

[7]  Artak Hakobyan,et al.  Heuristics for the dynamic facility layout problem with unequal-area departments , 2010, Eur. J. Oper. Res..

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

[9]  Sadan Kulturel-Konak,et al.  An artificial immune system based algorithm to solve unequal area facility layout problem , 2012, Expert Syst. Appl..

[10]  Reza Tavakkoli-Moghaddam,et al.  A multi-objective particle swarm optimisation algorithm for unequal sized dynamic facility layout problem with pickup/drop-off locations , 2012 .

[11]  Komarudin,et al.  Solving facility layout problems using Flexible Bay Structure representation and Ant System algorithm , 2010, Expert Syst. Appl..

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

[13]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

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

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

[16]  Abdullah Konak,et al.  Unequal area flexible bay facility layout using ant colony optimisation , 2011 .

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

[18]  R. Meller,et al.  A sequence-pair representation and MIP-model-based heuristic for the facility layout problem with rectangular departments , 2007 .

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

[20]  Alice E. Smith,et al.  A bi-objective model for the retail spatial design problem , 2012 .

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

[22]  Krishna K. Krishnan,et al.  Design of robust layout for Dynamic Plant Layout Problems , 2011, Comput. Ind. Eng..

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

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

[25]  Sadan Kulturel-Konak,et al.  A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays , 2012, Eur. J. Oper. Res..

[26]  Hanif D. Sherali,et al.  Applying the sequence-pair representation to optimal facility layout designs , 2007, Oper. Res. Lett..

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

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

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

[30]  Timothy L. Urban.  Solution procedures for the dynamic facility layout problem , 1998, Ann. Oper. Res..

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

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

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

[34]  David W. Coit,et al.  Exploiting Tabu Search Memory in Constrained Problems , 2004, INFORMS J. Comput..

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

[36]  Abdullah Konak,et al.  A new relaxed flexible bay structure representation and particle swarm optimization for the unequal area facility layout problem , 2011 .

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