A HYBRID ALGORITHM FOR OPTIMISING FACILITY LAYOUT

Despite the reported effectiveness of analytical algorithms in facility layout planning, a detailed literature survey suggests a lack of new analytical methods in recent years. This paper focuses on open space facilities layout planning that involves modules with constant aspect ratios. We propose a construction-cum-improvement algorithm involving a novel combination of a boundary search-based heuristic placement and steepest descent-based analytical improvement. In the construction phase, the algorithm places a new module at the optimal location on the boundary of a previously constructed cluster of modules. In the improvement phase, the algorithm alternates between boundary search and steepest descent moves until it converges to a local optimum. Experiments with well-known test problems indicate that the proposed algorithm produced solutions superior both to published results and to those produced by VIP-PLANOPT, a popular, oft-cited and commercially available layout planning and optimisation software.

[1]  Yoon Ho Seo,et al.  A two-step heuristic algorithm for layout design of unequal-sized facilities with input/output points , 2013 .

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

[3]  Mirko Ficko,et al.  Solving of Floor Layout Problem in Flexible Manufacturing System by Genetic Algorithms , 2010, Int. J. Adv. Intell. Paradigms.

[4]  M. Imam,et al.  A gradient-based method for module placement , 1990 .

[5]  Jamal Bashir Oheba A new framework considering uncertainty for facility layout problem , 2012 .

[6]  Berna Haktanirlar Ulutas,et al.  A clonal selection algorithm for dynamic facility layout problems , 2009 .

[7]  Otman Basir,et al.  An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization , 2006 .

[8]  A. D. Raoot,et al.  A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem , 1994 .

[9]  Daniel Scholz,et al.  Extensions to STaTS for practical applications of the facility layout problem , 2010, Eur. J. Oper. Res..

[10]  Ghorbanali Moslemipour,et al.  A review of intelligent approaches for designing dynamic and robust layouts in flexible manufacturing systems , 2012 .

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

[12]  Raúl Tempone,et al.  Convergence rates for adaptive approximation of ordinary differential equations , 2003, Numerische Mathematik.

[13]  A. Konak,et al.  Linear Programming Based Genetic Algorithm for the Unequal Area Facility Layout Problem , 2013 .

[14]  Cyril Fonlupt,et al.  Parallel Ant Colonies for the quadratic assignment problem , 2001, Future Gener. Comput. Syst..

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

[16]  M. Mir,et al.  Topology optimization of arbitrary-size blocks using a bivariate formulation , 1992, Comput. Aided Des..

[17]  Ashish Tiwari,et al.  A greedy genetic algorithm for the quadratic assignment problem , 2000, Comput. Oper. Res..

[18]  Miguel F. Anjos,et al.  Provably near-optimal solutions for very large single-row facility layout problems , 2009, Optim. Methods Softw..

[19]  Orhan Türkbey,et al.  A simulated annealing heuristic for the dynamic layout problem with budget constraint , 2010, Comput. Ind. Eng..

[20]  Alfonsas Misevicius,et al.  A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem , 2003, Informatica.

[21]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[22]  Mustahsan Mir,et al.  A hybrid optimization approach for layout design of unequal-area facilities , 2001 .

[23]  Chaomin Luo,et al.  Elsevier Editorial System(tm) for European Journal of Operational Research Title: a Convex Optimisation Framework for the Unequal-areas Facility Layout Problem a Convex Optimisation Framework for the Unequal-areas Facility Layout Problem , 2022 .

[24]  Michèle Sebag,et al.  Adaptive coordinate descent , 2011, GECCO '11.

[25]  Hasan Hosseini-Nasab,et al.  A hybrid particle swarm optimisation for dynamic facility layout problem , 2013 .

[26]  Fred W. Glover,et al.  A cooperative parallel tabu search algorithm for the quadratic assignment problem , 2009, Eur. J. Oper. Res..

[27]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[28]  K. Y. Tam,et al.  A simulated annealing algorithm for allocating space to manufacturing cells , 1992 .

[29]  Hamed Samarghandi,et al.  A Particle Swarm Optimization for the Single Row Facility Layout Problem , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[30]  Ming Dong,et al.  Shortest path based simulated annealing algorithm for dynamic facility layout problem under dynamic business environment , 2009, Expert Syst. Appl..

[31]  Chang-Lin Yang,et al.  A genetic algorithm for dynamic facility planning in job shop manufacturing , 2011 .

[32]  Abdul-Rahim Ahmad,et al.  An intelligent expert system for decision analysis and support in multi-attribute layout optimization , 2005 .

[33]  Mustahsan Mir,et al.  Analytic annealing for macrocell placement optimization , 1996 .

[34]  R. Chandrasekaran,et al.  Stock cutting to minimize cutting length , 1996 .

[35]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[36]  N. Jawahar,et al.  A new iterated fast local search heuristic for solving QAP formulation in facility layout design , 2009 .

[37]  Carlos García-Martínez,et al.  Memetic Algorithms for Continuous Optimisation Based on Local Search Chains , 2010, Evolutionary Computation.

[38]  Zvi Drezner,et al.  Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem , 2008, Comput. Oper. Res..

[39]  Dana S. Richards,et al.  Distributed genetic algorithms for the floorplan design problem , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

[42]  David E. Goldberg,et al.  Optimizing Global-Local Search Hybrids , 1999, GECCO.

[43]  Mustahsan Mir,et al.  Cluster boundary search algorithm for building-block layout optimization , 1998 .

[44]  Mustahsan Mir,et al.  Optimal placement for hierarchical VLSI layout design , 1989 .

[45]  P. S. Welgama,et al.  A construction algorithm for the machine layout problem with fixed pick-up and drop-off points , 1993 .

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

[47]  Andrea S. LaPaugh,et al.  VLSI Layout Algorithms , 1999, Algorithms and Theory of Computation Handbook.

[48]  Mustahsan Mir,et al.  Automated layout of facilities of unequal areas , 1993 .

[49]  M. Mir,et al.  Nonlinear programming approach to automated topology , 1989 .

[50]  Kazuhiro Kado,et al.  An Investigation of Genetic Algorithms for Facility Layout Problems , 1995 .

[51]  Yew-Soon Ong,et al.  Memetic Computation—Past, Present & Future [Research Frontier] , 2010, IEEE Computational Intelligence Magazine.

[53]  Miguel F. Anjos,et al.  Global Approaches for Facility Layout and VLSI Floorplanning , 2012 .

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