Population Heuristics for the Corridor Allocation Problem

The corridor allocation problem is one of assigning a given set of facilities in two rows along a straight corridor so as to minimize a weighted sum of the distances between every pair of facilities. This problem has practical applications in arrangements of rooms in oces and in hospitals. The problem is NP-hard. In this paper, we present two population based metaheuristic implementations for the problem; a genetic algorithm with local search embedded in it, and a scatter search algorithm with path relinking. We report the results of our experiments with these algorithms on benchmark instances with up to 49 facilities.

[1]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

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

[4]  Zeqiang Zhang,et al.  A corrected formulation for the double row layout problem , 2012 .

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

[6]  Ravi Kothari,et al.  Insertion based Lin-Kernighan heuristic for single row facility layout , 2013, Comput. Oper. Res..

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

[8]  J. M. A. Tanchoco,et al.  The double row layout problem , 2010 .

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

[10]  André R. S. Amaral.  Optimal solutions for the double row layout problem , 2013, Optim. Lett..

[11]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

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

[13]  André R. S. Amaral.  The corridor allocation problem , 2012, Comput. Oper. Res..

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

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

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

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

[18]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[19]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.