Skip to main content
SpringerLink
Log in

Population-based improvement heuristic with local search for single-row facility layout problem

  • Published:
Sādhanā Aims and scope Submit manuscript

Abstract

The Single-Row Facility Layout Problem (SRFLP) is a well-known combinatorial optimization problem. The objective of SRFLP is to find out the arrangement of facilities with given lengths on a line so that the weighted sum of the distances between all pairs of facilities is minimized. This problem is known to be NP-hard. Hence, a population-based improvement heuristic algorithm with local search is presented in this article to solve SRFLP. The proposed algorithm works well also for the Single-Row Equidistant Facility Layout Problem (SREFLP), where the length of each facility is equal. The computational efficiency of the proposed algorithm is checked with the instances of sizes ranging from 5 to 300 available in the literature for SRFLP and SREFLP. The obtained results are compared to those from different state-of-the-art algorithms. The proposed algorithm achieves best known solutions to date for every instance considered in this article in reasonable computational time.

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

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  5. Suryanarayanan J K, Golden B L and Wang Q 1991 A new heuristic for the linear placement problem. Comput. Oper. Res. 18(3): 255–262

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Kothari Ravi and Ghosh Diptesh 2012 The single row facility layout problem: state of the art. Opsearch. 49(4): 442–462

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Amaral A R S and Letchford A N 2013 A polyhedral approach to the single row facility layout problem. Math. Program. 141(1-2): 453–477

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Kothari R and Ghosh D 2014 An efficient genetic algorithm for single row facility layout. Optim. Lett. 8(2): 679–690

    Article  MathSciNet  MATH  Google Scholar 

  14. Hungerländer P 2014 Single-row equidistant facility layout as a special case of single-row facility layout. Int. J. Prod. Res. 52(5): 1257–1268

    Article  Google Scholar 

  15. Palubeckis G 2015 Fast simulated annealing for single-row equidistant facility layout. Appl. Math. Comput. 263: 287–301

    MathSciNet  MATH  Google Scholar 

  16. Sarker B R, Wilhelm W E and Hogg G L 1998 One-dimensional machine location problems in a multi-product flowline with equidistant locations. Eur. J. Oper. Res. 105(3): 401–426

    Article  MATH  Google Scholar 

  17. Yu J, Sarker B R 2003 Directional decomposition heuristic for a linear machine-cell location problem. Eur. J. Oper. Res. 149(1): 142–184

    Article  MathSciNet  MATH  Google Scholar 

  18. Anjos M F and Liers F 2012 Global approaches for facility layout and VLSI floorplanning. In: Handbook on Semidefinite, Conic and Polynomial Optimization, pp 849–877. Springer, Berlin

    Chapter  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. Keller B and Buscher U 2015 Single row layout models. Eur. J. Oper. Res. 245(3): 629–644

    Article  MathSciNet  MATH  Google Scholar 

  21. Anjos M F and Vieira M V C 2017 Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions. Eur. J. Oper. Res. 261(1): 1–16

    Article  MathSciNet  MATH  Google Scholar 

  22. Hungerländer P and Rendl F 2013 Semidefinite relaxations of ordering problems. Math. Program. 140(1): 77–97

    Article  MathSciNet  MATH  Google Scholar 

  23. Palubeckis G 2012 A branch-and-bound algorithm for the single-row equidistant facility layout problem. OR Spectr. 34(1): 1–21

    Article  MathSciNet  MATH  Google Scholar 

  24. Ozcelik F 2012 A hybrid genetic algorithm for the single row layout problem. Int. J. Prod. Res. 50(20): 5872–5886

    Article  Google Scholar 

  25. Kothari R and Ghosh D 2014 A scatter search algorithm for the single row facility layout problem. J. Heuristics 20(2): 125–142

    Article  Google Scholar 

  26. Palubeckis G 2015 Fast local search for single row facility layout. Eur. J. Oper. Res. 246(3): 800–814

    Article  MathSciNet  MATH  Google Scholar 

  27. Atta S, Mahapatra P R S and Mukhopadhyay A 2018 Solving maximal covering location problem using genetic algorithm with local refinement. Soft Comput. 22(12): 3891–3906

    Article  Google Scholar 

  28. Atta S, Mahapatra P R S and Mukhopadhyay A 2018 Deterministic and randomized heuristic algorithms for uncapacitated facility location problem. In: Information and Decision Sciences, pp. 205–216. Springer, Berlin

    Chapter  Google Scholar 

  29. Atta S, Mahapatra P R S and Mukhopadhyay A 2018 Solving uncapacitated facility location problem using monkey algorithm. In: Intelligent Engineering Informatics, pp. 71–78. Springer, Berlin

    Chapter  Google Scholar 

  30. Atta S, Mahapatra P R S and Mukhopadhyay A 2019 Multi-objective uncapacitated facility location problem with customers preferences: Pareto-based and weighted sum ga-based approaches. Soft Comput.. https://doi.org/10.1007/s00500-019-03774-1

    Article  Google Scholar 

  31. Atta S, Mahapatra P R S and Mukhopadhyay A 2019 Solving uncapacitated facility location problem using heuristic algorithms. Int. J. Nat. Comput. Res. (IJNCR) 8(2): 18–50

    Article  Google Scholar 

  32. Atta S, Sinha Mahapatra P R and Mukhopadhyay A 2019 Solving tool indexing problem using harmony search algorithm with harmony refinement. Soft Comput. 23(16): 7407–7423

    Article  Google Scholar 

  33. Love R and Wong J 1976 On solving a one-dimensional space allocation problem with integer programming. INFOR: Inf. Syst. Oper. Res. 14(2): 139–143

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  48. Satheesh K R M, Asokan P, Kumanan S and Varma B 2008 Scatter search algorithm for single row layout problem in FMS. Adv. Prod. Eng. Manag. 3: 193–204

    Google Scholar 

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

    Article  Google Scholar 

  50. Ficko M, Brezocnik M and Balic J 2004 Designing the layout of single-and multiple-rows flexible manufacturing system by genetic algorithms. J. Mater. Process. Technol. 157: 150–158

    Article  Google Scholar 

  51. Rubio-Sánchez M, Gallego M, Gortázar F and Duarte A 2016 GRASP with path relinking for the single row facility layout problem. Knowl.-Based Syst. 106: 1–13

    Article  Google Scholar 

  52. Teo Y T and Ponnambalam S G 2008 A hybrid ACO/PSO heuristic to solve single row layout problem. In: IEEE International Conference on Automation Science and Engineering, 2008. CASE 2008. IEEE, pp. 597–602

  53. Kunlei L, Chaoyong Z, Liang G and Xinyu S 1995 Single row facility layout problem using an imperialist competitive algorithm. In: Proceedings of the 41st International Conference on Computers & Industrial Engineering

  54. Palubeckis G 2013 Single row facility layout. https://www.personalas.ktu.lt/~ginpalu/srflp.html

  55. Obata T 1979 Quadratic assignment problem: evaluation of exact and heuristic algorithms. Ph.D. thesis

  56. Sarker B R 1990 The amoebic matrix and one-dimensional machine location problems. J. Oper. Manag. 9(3): 439–440

    Article  Google Scholar 

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

    Article  Google Scholar 

  58. Skorin-Kapov J 1990 Tabu search applied to the quadratic assignment problem. ORSA J. Comput. 2(1): 33–45

    Article  MATH  Google Scholar 

  59. Loiola E M, de Abreu N M M, Boaventura-Netto P O, Hahn P and Querido T 2007 A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2): 657–690

    Article  MathSciNet  MATH  Google Scholar 

  60. Letchford A N and Amaral A 2011 A polyhedral approach to the single row facility layout problem. Technical Report 49043, The Department of Management Science, Lancaster University

Download references

Acknowledgements

P R S Mahapatra, second author of this article, has been partially supported by DST-PURSE scheme, Government of India, at University of Kalyani.

Author information

Authors and Affiliations

  1. Indian Institute of Information Technology (IIIT) Vadodara, Gandhinagar Campus, Sector 28, Gandhinagar, Gujarat, 382028, India

    Soumen Atta

  2. Department of Computer Science and Engineering, University of Kalyani, Kalyani, 741235, India

    Priya Ranjan Sinha Mahapatra

Authors
  1. Soumen Atta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Priya Ranjan Sinha Mahapatra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soumen Atta.

Additional information

$S. Atta is currently on leave from IIIT Vadodara and is now associated with the Faculty of Informatics, Masaryk University, Botanická 68a, Brno, Czech Republic as a Postdoctoral researcher.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Atta, S., Sinha Mahapatra, P.R. Population-based improvement heuristic with local search for single-row facility layout problem. Sādhanā 44, 222 (2019). https://doi.org/10.1007/s12046-019-1203-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s12046-019-1203-0

Keywords

Search

Navigation