A hybrid genetic algorithm for the single row layout problem

The arrangement of machines or departments along a straight line is known as single row layout and it is a widely employed configuration in flexible manufacturing systems. In this paper, a hybrid genetic algorithm (HGA) is proposed to solve the single row layout design problem with unequal sized machines and unequal clearances. The algorithm is developed by hybridisation of a genetic algorithm with a local search operator. The proposed HGA is tested on 51 well known data sets from the literature with equal and unequal clearances, and the results are compared with the best known solutions. Finally, algorithm's effectiveness in reaching previously known best solutions is revealed and improvements up to 7% in problems with unequal clearance are obtained.

[1]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[2]  Zhang Wei Bo,et al.  Optimization of process route by Genetic Algorithms , 2006 .

[3]  S.G. Ponnambalam,et al.  Design of single-row layouts for flexible manufacturing systems using genetic algorithm and simulated annealing algorithm , 2004, IEEE Conference on Cybernetics and Intelligent Systems, 2004..

[4]  Farrokh Neghabat,et al.  An Efficient Equipment-Layout Algorithm , 1974, Oper. Res..

[5]  Mitsuo Gen,et al.  Loop layout design problem in flexible manufacturing systems using genetic algorithms , 1998 .

[6]  Kourosh Eshghi,et al.  An efficient tabu algorithm for the single row facility layout problem , 2010, Eur. J. Oper. Res..

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

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

[9]  Andrew Kusiak,et al.  Machine Layout Problem in Flexible Manufacturing Systems , 1988, Oper. Res..

[10]  S. G. Ponnambalam,et al.  A Genetic Algorithm for the Design of a Single-Row Layout in Automated Manufacturing Systems , 2001 .

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

[12]  Ravi Shankar,et al.  An ant algorithm for the single row layout problem in flexible manufacturing systems , 2005, Comput. Oper. Res..

[13]  Andrew A. Kennings,et al.  A semidefinite optimization approach for the single-row layout problem with unequal dimensions , 2005, Discret. Optim..

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

[15]  José Rui Figueira,et al.  Single row facility layout problem using a permutation-based genetic algorithm , 2011, Eur. J. Oper. Res..

[16]  Kenneth M. Hall.  An r-Dimensional Quadratic Placement Algorithm , 1970 .

[17]  Anthony Vannelli,et al.  Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes , 2008, INFORMS J. Comput..

[18]  Marcello Braglia.  Heuristics for single row layout problems in flexible manufacturing systems , 1997 .

[19]  S. Sahu,et al.  Multiobjective facility layout using simulated annealing , 1993 .

[20]  S. G. Ponnambalam,et al.  A hybrid ACO/PSO heuristic to solve single row layout problem , 2008, 2008 IEEE International Conference on Automation Science and Engineering.

[21]  İ. K. Altinel *,et al.  Design of unidirectional cyclic layouts , 2005 .

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

[23]  Ying-Chin Ho,et al.  Machine layout with a linear single-row flow path in an automated manufacturing system , 1998 .

[24]  Barbaros Ç. Tansel,et al.  Move based heuristics for the unidirectional loop network layout problem , 1998, Eur. J. Oper. Res..

[25]  K. Ravi Kumar,et al.  A heuristic procedure for the single-row facility layout problem , 1995 .

[26]  M. Held,et al.  Finite-State Processes and Dynamic Programming , 1967 .

[27]  Wen-Chyuan Chiang,et al.  A simulated annealing procedure for single row layout problems in flexible manufacturing systems , 1992 .

[28]  Hsiao-Fan Wang,et al.  Hybrid genetic algorithm for optimization problems with permutation property , 2004, Comput. Oper. Res..

[29]  André R. S. Amaral.  An Exact Approach to the One-Dimensional Facility Layout Problem , 2008, Oper. Res..

[30]  Maurice Queyranne,et al.  On the One-Dimensional Space Allocation Problem , 1981, Oper. Res..

[31]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[32]  André R. S. Amaral.  On the exact solution of a facility layout problem , 2006, Eur. J. Oper. Res..

[33]  Adam N. Letchford,et al.  A polyhedral approach to the single row facility layout problem , 2013, Math. Program..

[34]  André R. S. Amaral.  A new lower bound for the single row facility layout problem , 2009, Discret. Appl. Math..

[35]  Mohsen M. D. Hassan,et al.  Machine layout problem in modern manufacturing facilities , 1994 .

[36]  P. Asokan,et al.  SCATTER SEARCH ALGORITHM FOR SINGLE ROW LAYOUT PROBLEM IN FMS , 2008 .

[37]  Michel Gourgand,et al.  A new heuristic procedure for the single-row facility layout problem , 2001, Int. J. Comput. Integr. Manuf..

[38]  J. Y. Wong,et al.  On Solving A One-Dimensional Space Allocation Problem With Integer Programming , 1976 .

[39]  Donald M. Simmons.  One-Dimensional Space Allocation: An Ordering Algorithm , 1969, Oper. Res..