Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm

The corridor allocation problem (CAP) seeks an effective placement of given facilities in two parallel rows on opposite sides of a central corridor. The placement of the facilities in both the rows starts from the same level along the corridor and no gap is allowed between two facilities of a row. The CAP is formulated here as a nonlinear bi-objective optimization problem, in which both the overall flow cost among the facilities and the length of the corridor are to be minimized. A permutation-based genetic algorithm (pGA) is applied to handle the CAP as an unconstrained bi-objective optimization problem. The performance of the pGA is demonstrated through its application to a number of instances of varying sizes available in the literature. The results presented in this paper can be used as benchmark instances in the future work on the CAP.

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

[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]  José Rui Figueira,et al.  Single row facility layout problem using a permutation-based genetic algorithm , 2011, Eur. J. Oper. Res..

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

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

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

[8]  José Rui Figueira,et al.  Some convergence-based M-ary cardinal metrics for comparing performances of multi-objective optimizers , 2012, Comput. Oper. Res..

[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]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

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

[12]  Kalyanmoy Deb,et al.  A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems , 2008, J. Sched..

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

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

[15]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

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

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

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

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

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

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

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

[23]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

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

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

[26]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.