Skip to main content

An efficient genetic algorithm for single row facility layout

Abstract

The single row facility layout is the NP-Hard problem of arranging facilities with given lengths on a line, so as to minimize the weighted sum of the distances between all pairs of facilities. Owing to its computational complexity, researchers have developed several heuristics to obtain good quality solutions. In this paper, we present a genetic algorithm called GENALGO to solve large single row facility layout problem instances. Our algorithm uses standard genetic operators and periodically improves the fitness of all individuals. Our computational experiments show that our genetic algorithm yields high quality solutions in spite of starting with an initial population that is randomly generated. Our algorithm improves the previously best known solutions for the 19 instances of 58 benchmark instances and is competitive for most of the remaining ones.

This is a preview of subscription content, access via your institution.

References

  1. 1.

    Amaral, A.R.S.: On the exact solution of a facility layout problem. Eur. J. Oper. Res. 173(2), 508–518 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. 2.

    Amaral, A.R.S.: An exact approach to the one-dimensional facility layout problem. Oper. Res. 56(4), 1026–1033 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. 3.

    Amaral, A.R.S.: A new lower bound for the single row facility layout problem. Discret. App. Math. 157(1), 183–190 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  4. 4.

    Amaral, A.R.S., Letchford, A.N.: A polyhedral approach to the single row facility layout problem. Math. Program.(2012). doi:10.1007/s10107-012-0533-z

  5. 5.

    Anjos, M.F., Kennings, A., Vannelli, A.: A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discret. Optim. 2(2), 113–122 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. 6.

    Anjos, M.F., Vannelli, A.: Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes. INFORMS J. Comput. 20(4), 611–617 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  7. 7.

    Anjos, M.F., Yen, G.: Provably near-optimal solutions for very large single-row facility layout problems. Optim. Meth. Soft. 24(4–5), 805–817 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  8. 8.

    Beghin-Picavet, M., Hansen, P.: Deux problèmes d’affectation non linéaires. RAIRO, Oper. Res. Rech. Opér. 16(3), 263–276 (1982)

    MATH  Google Scholar 

  9. 9.

    Datta, D., Amaral, A.R.S., Figueira, J.R.: Single row facility layout problem using a permutation-based genetic algorithm. Eur. J. Oper. Res. 213(2), 388–394 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  10. 10.

    de Alvarenga, A.G., Negreiros-Gomes, F.J., Mestria, M.: Metaheuristic methods for a class of the facility layout problem. J. Intell. Manuf. 11, 421–430 (2000)

    Article  Google Scholar 

  11. 11.

    Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. Wiley, Chichester (2001)

    MATH  Google Scholar 

  12. 12.

    Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1989)

    MATH  Google Scholar 

  13. 13.

    Heragu, S.S., Alfa, A.S.: Experimental analysis of simulated annealing based algorithms for the layout problem. Eur. J. Oper. Res. 57(2), 190–202 (1992)

    Article  MATH  Google Scholar 

  14. 14.

    Heragu, S.S., Kusiak, A.: Machine layout problem in flexible manufacturing systems. Oper. Res. 36(2), 258–268 (1988)

    Article  Google Scholar 

  15. 15.

    Heragu, S.S., Kusiak, A.: Efficient models for the facility layout problem. Eur. J. Oper. Res. 53, 1–13 (1991)

    Article  MATH  Google Scholar 

  16. 16.

    Hungerländer, P., Rendl, F.: A computational study for the single-row facility layout problem (2011). http://www.optimization-online.org/DB_FILE/2011/05/3029.pdf

  17. 17.

    Kumar, S., Asokan, P., Kumanan, S., Varma, B.: Scatter search algorithm for single row layout problem in fms. Adv. Prod. Eng. Manag. 3(4), 193–204 (2008)

    Google Scholar 

  18. 18.

    Larrañaga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artif. Intell. Rev. 13(2), 129–170 (1999)

    Article  Google Scholar 

  19. 19.

    Letchford, A.N., Amaral, A.R.S.: A polyhedral approach to the single row facility layout problem. Tech. rep. The Department of Management Science, Lancaster University, UK (2011)

    Google Scholar 

  20. 20.

    Lian, K., Zhang Chaoyong, Z., Gao, L., Xinyu, S.: Single row facility layout problem using an imperialist competitive algorithm. In: Proceedings of the 41st International Conference on, Computers and Industrial Engineering, pp. 578–586 (2011)

  21. 21.

    Love, R.F., Wong, J.Y.: On solving a one-dimensional space allocation problem with integer programming. INFOR 14(2), 139–144 (1976)

    MATH  Google Scholar 

  22. 22.

    Ozcelik, F.: A hybrid genetic algorithm for the single row layout problem. Int. J. Prod. Res. (2011). doi:10.1080/00207543.2011.636386

  23. 23.

    Picard, J.C., Queyranne, M.: On the one-dimensional space allocation problem. Oper. Res. 29(2), 371–391 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  24. 24.

    Ravi Kumar, K., Hadjinicola, G.C., Lin, T.L.: A heuristic procedure for the single-row facility layout problem. Eur. J. Oper. Res. 87(1), 65–73 (1995)

    Article  MATH  Google Scholar 

  25. 25.

    Romero, D., Sánchez-Flores, A.: Methods for the one-dimensional space allocation problem. Comput. Oper. Res. 17(5), 465–473 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  26. 26.

    Samarghandi, H., Eshghi, K.: An efficient tabu algorithm for the single row facility layout problem. Eur. J. Oper. Res. 205(1), 98–105 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  27. 27.

    Samarghandi, H., Taabayan, P., Jahantigh, F.F.: A particle swarm optimization for the single row facility layout problem. Comput. Ind. Eng. 58(4), 529–534 (2010)

    Article  Google Scholar 

  28. 28.

    Simmons, D.M.: One-dimensional space allocation: an ordering algorithm. Oper. Res. 17(5), 812–826 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  29. 29.

    Solimanpur, M., Vrat, P., Shankar, R.: An ant algorithm for the single row layout problem in flexible manufacturing systems. Comput. Oper. Res. 32(3), 583–598 (2005)

    Article  MATH  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Ravi Kothari.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kothari, R., Ghosh, D. An efficient genetic algorithm for single row facility layout. Optim Lett 8, 679–690 (2014). https://doi.org/10.1007/s11590-012-0605-2

Download citation

Keywords

  • Facilities planning and design
  • Single row facility layout
  • Genetic algorithm
  • Local search