Two-stage Tabu — Particle swarm algorithms for the facility layout problem with size constraints

The Facility Layout Problem (FLP) in this paper is an extension of the traditional Quadratic Assignment Problems (QAP). While the objective is still to minimize the summed cost of the (flow ∗ distance), the facilities in the FLP have different given sizes and their locations must be determined on a continual planar site. Based on the visual facility layout design system proposed by Chiang [13], this paper presents a study on using Tabu Search (TS), Particle Swarm Optimization (PSO) and their combinations (TS+PSO and PSO+TS) to tackle the FLP. The computation results show that the two-stage algorithms are able to achieve better results in most cases than TS and PSO individually on the FLP. The proposed two-stage algorithms and visual layout design system provide an effective tool to solve the practical FLP.

[1]  John S. Usher,et al.  Facility layout using swarm intelligence , 2005, Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005..

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

[3]  Eric M. Malstrom,et al.  A comparison of three computer assisted facilities design algorithms , 1989 .

[4]  P. Asokan,et al.  A solution to the facility layout problem having passages and inner structure walls using particle swarm optimization , 2006 .

[5]  D. T. Gethin,et al.  An effective sorting method for facility layout construction , 1993 .

[6]  Wen-Chyuan Chiang.  Visual facility layout design system , 2001 .

[7]  Ajith Abraham,et al.  Swarm Intelligence: Foundations, Perspectives and Applications , 2006, Swarm Intelligent Systems.

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

[9]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[10]  Mounir Ben Ghalia,et al.  Regrouping particle swarm optimization: A new global optimization algorithm with improved performance consistency across benchmarks , 2009, 2009 IEEE International Conference on Systems, Man and Cybernetics.

[11]  Wen-Chyuan Chiang,et al.  An improved tabu search heuristic for solving facility layout design problems , 1996 .

[12]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

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

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

[15]  Jiefeng Xu,et al.  Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search , 1999 .

[16]  S. Chittratanawat.  An integrated approach for facility layout, P/D location and material handling system design , 1999 .

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