A two-step heuristic algorithm for layout design of unequal-sized facilities with input/output points

The facility layout problem (FLP) is to arrange facilities within a given area so as to minimise the total material-handling cost. An efficient arrangement of facilities plays an important part in the achievement of high productivity in a manufacturing system. This paper focuses on the layout design of unequal-sized facilities with fixed shapes and input/output (I/O) points. A mixed-integer programming (MIP) model is developed to obtain optimal solutions. Since the MIP model is not applicable to large-sized problems, a two-step heuristic algorithm is developed to solve the FLPs. In the first step, a layout solution with moderate quality is generated by using an interconnected zone algorithm and a simulated annealing (SA) algorithm. The zone algorithm is a newly developed layout construction technique which places facilities successively within designated zones according to a placing sequence. The zone concept is introduced to reduce the solution space such that the computational effort is decreased, while SA is used to search for the placing sequences. The second step improves that solution further using the reduced MIP by employing the relative position information obtained from the first step. Computational experiments indicate that the algorithm in the first step can yield on average a 1.048% improvement on the best solutions obtained by the existing algorithms. The second step can further improve the solutions obtained in the first step by 0.484% on average. Compared to the commercial software VIP-PLANOPT 2006 (Engineering Optimization Software 2005), the proposed two-step algorithm improves the solutions by 9.113% on average.

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

[2]  S. Heragu,et al.  Efficient models for the facility layout problem , 1991 .

[3]  Charles J. Malmborg,et al.  A two-stage simulated annealing procedure for block layout problems , 2006 .

[4]  Weihang Zhu,et al.  SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration , 2010 .

[5]  Yeong-Dae Kim,et al.  Layout planning for facilities with fixed shapes and input and output points , 2000 .

[6]  Abdelghani Souilah,et al.  Simulated annealing for manufacturing systems layout design , 1995 .

[7]  Sanchoy K. Das,et al.  A facility layout method for flexible manufacturing systems , 1993 .

[8]  Henri Pierreval,et al.  Facility layout problems: A survey , 2007, Annu. Rev. Control..

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

[10]  Taho Yang,et al.  A genetic algorithm for facility layout design in flexible manufacturing systems , 1998 .

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

[12]  S. P. Singh,et al.  Two-level modified simulated annealing based approach for solving facility layout problem , 2008 .

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

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

[15]  Rrk Sharma,et al.  A review of different approaches to the facility layout problems , 2006 .

[16]  Taho Yang,et al.  Layout design for flexible manufacturing systems considering single-loop directional flow patterns , 2005, Eur. J. Oper. Res..

[17]  Abdel Nasser,et al.  A Survey of the Quadratic Assignment Problem , 2014 .

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

[19]  Michael H. Hu,et al.  Simulated annealing based parallel genetic algorithm for facility layout problem , 2011 .

[20]  Engelbert Westkämper,et al.  A coevolutionary algorithm for a facility layout problem , 2003 .

[21]  Hamidreza Navidi,et al.  A heuristic approach on the facility layout problem based on game theory , 2012 .