Skip to main content

A scatter search algorithm for the single row facility layout problem

Abstract

The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, with the objective of minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard and research has focused on heuristics to solve large instances of the problem. In this paper we present a scatter search algorithm to solve large size SRFLP instances. Our computational experiments show that the scatter search algorithm is an algorithm of choice when solving large size SRFLP instances within limited time.

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

Fig. 1

References

  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. 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. Amaral, A.R.S.: A new lower bound for the single row facility layout problem. Discret. Appl. Math. 157(1), 183–190 (2009)

    Article  MATH  MathSciNet  Google Scholar 

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

  5. Amaral, A.R.S.: The corridor allocation problem. Comput. Oper. Res. 39(12), 3325–3330 (2012)

    Article  MathSciNet  Google Scholar 

  6. 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 

  7. Anjos, M.F., Liers, F.: Handbook on Semidefinite, Cone and Polynomial Optimization, volume 166 of International Series in Operations Research & Management Science, chapter Global Approaches for Facility Layout and VLSI Floorplanning, pp. 849–877. Springer, Berlin (2012)

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Beghin-Picavet, M., Hansen, P.: Deux problèmes daffectation non linéaires. RAIRO Recherche Opérationnelle 16(3), 263–276 (1982)

    MATH  Google Scholar 

  11. Chung, J., Tanchoco, J.: The double row layout problem. Int. J. Prod. Res. 48(3), 709–727 (2010)

    Article  MATH  Google Scholar 

  12. 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 

  13. Djellab, H., Gourgand, M.: A new heuristic procedure for the single-row facility layout problem. Int. J. Comput. Integr. Manuf. 14(3), 270–280 (2001)

    Article  Google Scholar 

  14. Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156–166 (1977)

    Article  Google Scholar 

  15. Glover, F.: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discret. Appl. Math. 49, 231–255 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  16. Glover, F.: Scatter search and star-paths: beyond the genetic metaphor. OR Spectr. 17, 125–137 (1995). doi:10.1007/BF01719256

    Article  MATH  Google Scholar 

  17. Glover, F.: A template for scatter search and path relinking. Lect. Notes Comput. Sci. 1363, 13–54 (1998)

    Google Scholar 

  18. Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control Cybern. 39, 653–684 (2000)

    Google Scholar 

  19. Gomes de Alvarenga, A., 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 

  20. 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 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  23. Hungerländer, P., Rendl, F.: A computational study and survey of methods for the single-row facility layout problem. Comput. Optim. Appl. 55(1), 1–20 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  24. Kothari, R., Ghosh, D.: Path relinking algorithms for single row facility layout (w.p. no. 2012–05-01). Ahmedabad, India: IIM Ahmedabad, Production & Quantitative Methods. Available at (2012a) http://www.iimahd.ernet.in/assets/snippets/workingpaperpdf/6038336162012-05-01.pdf

  25. Kothari, R., Ghosh, D.: The single row facility layout problem: state of the art. Opsearch 49, 442–462 (2012b)

    Article  MATH  MathSciNet  Google Scholar 

  26. Kothari, R., Ghosh, D.: An efficient genetic algorithm for single row facility layout. Optim. Lett.10.1007/s11590-012-0605-2 (2013a)

  27. Kothari, R., Ghosh, D.: Insertion based Lin–Kernighan heuristic for single row facility layout. Comput. Oper. Res. 40(1), 129–136 (2013b)

    Article  MathSciNet  Google Scholar 

  28. Kothari, R., Ghosh, D.: Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods. Eur. J. Oper. Res. 224(1), 93–100 (2013c)

    Article  MathSciNet  Google Scholar 

  29. Kumar, R.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 

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

  31. Laguna, M., Martí, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic Publishers, Boston (2003)

    Book  Google Scholar 

  32. 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 

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

  34. 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 

  35. Martí, R., Glover, F., Laguna, M.: Principles of scatter search. Eur. J. Oper. Res. 169(2), 359–372 (2006)

    Article  MATH  Google Scholar 

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

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

    Article  MATH  MathSciNet  Google Scholar 

  38. 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 

  39. 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 

  40. 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 

  41. Sanjeevi, S., Kianfar, K.: A polyhedral study of triplet formulation for single row facility layout problem. Discret. Appl. Math. 158(16), 1861–1867 (2010)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  43. 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 

  44. Sörensen, K.: Distance measures based on the edit distance for permutation-type representations. J. Heuristics 13, 35–47 (2007). doi:10.1007/s10732-006-9001-3

    Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Ravi Kothari.

Appendix

Appendix

The permutation of facilities for the instance sko-81-01 for which the SS-1P algorithm improved the best solution known in the literature is given below. The facilities are numbered from 1 through 81.

66 74 3 61 30 25 50 9 48 56 67 65 33 69 23 17 4 6 41 21 81 14 15 19 38 49 31 7 39 36 26 70 35 42 22 55 11 57 78 44 2 45 52 32 68 13 62 1 5 27 58 20 18 73 43 59 24 51 37 63 12 79 75 80 77 71 72 29 64 46 28 10 40 34 76 16 54 53 60 47 8

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kothari, R., Ghosh, D. A scatter search algorithm for the single row facility layout problem. J Heuristics 20, 125–142 (2014). https://doi.org/10.1007/s10732-013-9234-x

Download citation

Keywords

  • Facilities planning and design
  • Single row facility layout
  • Scatter search
  • Heuristics