Path Relinking for Single Row Facility Layout

The single row facility layout problem is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. In this paper we present path relinking algorithms to solve large sized instances of the problem. We use three different metaheuristics to generate sets of good quality initial solutions and subject the solutions in these sets to path relinking. We present our computational experience on 43 benchmark instances with up to 110 facilities.

[1]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

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

[3]  Gerhard Reinelt,et al.  The Linear Ordering Problem , 2011 .

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

[5]  Paola Festa.  Linear Ordering Problem , 2009, Encyclopedia of Optimization.

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

[7]  David Romero,et al.  Methods for the one-dimensional space allocation problem , 1990, Comput. Oper. Res..

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

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

[10]  Ravi Kothari,et al.  Scatter search algorithms for the single row facility layout problem , 2012 .

[11]  Jordi Petit,et al.  Experiments on the minimum linear arrangement problem , 2003, ACM J. Exp. Algorithmics.

[12]  D. Ghosh,et al.  A Lin-Kernighan Heuristic for Single Row Facility Layout , 2012 .

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

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

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

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

[17]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

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

[19]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

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

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

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

[23]  Kenneth Sörensen,et al.  Distance measures based on the edit distance for permutation-type representations , 2007, J. Heuristics.

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

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

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

[27]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[28]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

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

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

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

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

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

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

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

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

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