A GRASP algorithm for solving large-scale single row facility layout problems

Abstract The single-row facility layout problem (SRFLP) is an NP-hard problem, which consists of arranging facilities along a straight line in order to minimize the weighted sum of distances between all pairs of facilities. In this paper, an implementation of the Greedy Randomized Adaptive Search Procedure (GRASP) meta-heuristic is presented to solve large-scale instances of the problem. The novelty of the proposed implementation is that it is endowed with a diversification phase based on frequency memory. The algorithm was tested on 93 instances with sizes up to one thousand facilities. To date, in the literature, there is only one work, which has considered instances of such magnitude. Computational experiments demonstrate the efficiency of the proposed algorithm, which improved the best-known values for 29 out of 93 instances.

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

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

[3]  Mário Mestria,et al.  Metaheuristic methods for a class of the facility layout problem , 2000, J. Intell. Manuf..

[4]  S. Binato,et al.  Power transmission network design by greedy randomized adaptive path relinking , 2005, IEEE Transactions on Power Systems.

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

[6]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[7]  Ravi Kothari,et al.  A scatter search algorithm for the single row facility layout problem , 2014, J. Heuristics.

[8]  Manuel Laguna,et al.  Tabu Search , 1997 .

[9]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[10]  Ravi Kothari,et al.  The single row facility layout problem: state of the art , 2012 .

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

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

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

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

[15]  Ravi Kothari,et al.  An efficient genetic algorithm for single row facility layout , 2014, Optim. Lett..

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

[17]  Gintaras Palubeckis.  Fast local search for single row facility layout , 2015, Eur. J. 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]  Ajith Abraham,et al.  Swarm Intelligence: Foundations, Perspectives and Applications , 2006, Swarm Intelligent Systems.

[20]  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).

[21]  Jian Guan,et al.  Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem , 2016, Eur. J. Oper. Res..

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

[23]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[24]  Franz Rendl,et al.  A computational study and survey of methods for the single-row facility layout problem , 2013, Comput. Optim. Appl..

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

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

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

[28]  Ravi Kothari,et al.  Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods , 2013, Eur. J. Oper. Res..

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

[30]  Feristah Ozcelik.  A hybrid genetic algorithm for the single row layout problem , 2012 .

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

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

[33]  Glaydston Mattos Ribeiro,et al.  A greedy randomized adaptive search procedure for the point-feature cartographic label placement , 2008, Comput. Geosci..

[34]  Gintaras Palubeckis.  Single row facility layout using multi-start simulated annealing , 2017, Comput. Ind. Eng..

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

[36]  Francisco Gortázar,et al.  GRASP with path relinking for the single row facility layout problem , 2016, Knowl. Based Syst..