Skip to main content
SpringerLink
Log in

The single row facility layout problem: state of the art

  • Theoretical Article
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

The single row facility layout problem (SRFLP) is a NP-hard problem concerned with the arrangement of facilities of given lengths on a line so as to minimize the weighted sum of the distances between all the pairs of facilities. The SRFLP and its special cases often arise while modeling a large variety of applications. It has been actively researched until the mid-nineties, and then again since 2005. Interestingly, research on many aspects of this problem is still in the initial stages, and hence the SRFLP is an interesting problem to work on. In this paper, we review the literature on the SRFLP and comment on its relationship with other layout problems. We then provide an overview of different formulations of the problem that appear in the literature. We provide exact and heuristic approaches that have been used to solve SRFLPs, and also present details about the benchmark instances widely used in the literature. We finally point out research gaps and promising directions for future research on this problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

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  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  Google Scholar 

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

    Article  Google Scholar 

  4. Amaral, A.R.S.: A mixed 0–1 linear programming formulation for the exact solution of the minimum linear arrangement problem. Optim. Lett. 3, 513–520 (2009)

    Article  Google Scholar 

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

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

    Article  Google Scholar 

  7. 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  Google Scholar 

  8. 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  Google Scholar 

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

    Google Scholar 

  10. 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  Google Scholar 

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

  12. Díaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313–356 (2002)

    Article  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.: A template for scatter search and path relinking. Lect. Notes Comput. Sci. 1363, 13–54 (1998)

    Google Scholar 

  15. Greenberg, H.: Advances in computational and stochastic optimization, logic programming, and heuristic search, chap. An annotated bibliography for post- solution analysis in mixed integer programming and combinatorial optimization, pp. 97–148. Kluwer Academic Publishers, Boston, MA, USA (1998)

  16. Harper, L.H.: Optimal assignments of numbers to vertices. J. Soc. Ind. Appl. Math. 12(1), 131–135 (1964)

    Article  Google Scholar 

  17. 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  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

  21. Hungerländer, P., Rendl, F.: Semidefinite relaxations of ordering problems. Math. Program. B (2011)

  22. Knuth, D.: Seminumerical Algorithms (3rd edn.). The Art of Computer Programming (Vol. 2). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA (1997)

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

    Google Scholar 

  24. 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 (2011)

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

    Google Scholar 

  26. Nugent, C.E., Vollman, T.E., Ruml, J.: An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. 16(1), 150–173 (1968)

    Article  Google Scholar 

  27. Petit, J.: Experiments on the minimum linear arrangement problem. J. Exp. Algorithmics 8, Article 2.3 (2003)

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

    Article  Google Scholar 

  29. 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  Google Scholar 

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

    Article  Google Scholar 

  31. 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  Google Scholar 

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

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

    Article  Google Scholar 

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

Download references

Acknowledgement

The authors thank the anonymous reviewer whose comments have helped in vastly improving the previous version of the manuscript.

Author information

Authors and Affiliations

  1. P&QM Area, Indian Institute of Management Ahmedabad, Vastrapur, Ahmedabad, 380015, Gujarat, India

    Ravi Kothari & Diptesh Ghosh

Authors
  1. Ravi Kothari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Diptesh Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ravi Kothari.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kothari, R., Ghosh, D. The single row facility layout problem: state of the art. OPSEARCH 49, 442–462 (2012). https://doi.org/10.1007/s12597-012-0091-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-012-0091-4

Keywords

Search

Navigation