Skip to main content
SpringerLink
Log in

Parallel hybrid BBO-TS algorithm for QAP-formulation of FLP

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper deals with the facility layout problem (FLP) in manufacturing systems, the main purpose of the paper is to solve the static facility layout problem as a quadratic assignment problem QAP using approximated approaches. We present Bio-geography Based Optimization meta-heuristic BBO and a parallel hybrid BBO with tabu search PBBO-TS algorithm to solve the facility layout problem. Parallel computing is implemented to diversify the search, to increase the performance of BBO algorithm, and to accelerate the speed of the running time. The proposed approaches were tested on QAPLIB benchmark instances and compared with some of the best performing sequential and parallel algorithms in the literature. The comparisons prove that the proposed algorithm PBBO-TS produce satisfactory results. In addition, the performance of the parallel implementation of the program is studied in terms of speedup and efficiency; the obtained results show that the parallel implemented system is scalable.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Availability of data and materials

The data that support the findings in this study are openly available in QAPLIB Home Page at http://anjos.mgi.polymtl.ca/qaplib/(the online version of QAPLIB - A Quadratic Assignment Problem library by Burkard et al. [7])

References

  1. Abedzadeh M, Mazinani M, Moradinasab N, Roghanian E (2013) Parallel variable neighborhood search for solving fuzzy multi-objective dynamic facility layout problem. Int J Adv Manuf Technol 65 (1-4):197–211

    Article  Google Scholar 

  2. Bazaraa MS (1975) Computerized layout design: a branch and bound approach. AIIE Trans 7 (4):432–438

    Article  MathSciNet  Google Scholar 

  3. Beresnev V (2013) Branch-and-bound algorithm for a competitive facility location problem. Comput Oper Res 40(8):2062–2070

    Article  MathSciNet  Google Scholar 

  4. Blanks JP (1985) Near-optimal quadratic-based placement for a class of ic layout problems. IEEE Circ Devices Mag 1(5):31–37

    Article  Google Scholar 

  5. Burkard R, Bonninger T (1983) A heuristic for quadratic boolean program with applications to quadratic assignment problems. Eur J Oper Res 13:374–386

    Article  MathSciNet  Google Scholar 

  6. Burkard RE (1984) Quadratic assignment problems. Eur J Oper Res 15(3):283–289

    Article  MathSciNet  Google Scholar 

  7. Burkard RE, Karisch SE, Rendl F (1997) Qaplib–a quadratic assignment problem library. J Global Optim 10(4):391–403

    Article  MathSciNet  Google Scholar 

  8. Christofides N, Benavent E (1989) An exact algorithm for the quadratic assignment problem on a tree. Oper Res 37(5):760– 768

    Article  MathSciNet  Google Scholar 

  9. Elshafei AN (1977) Hospital layout as a quadratic assignment problem. J Oper Res Soc 28 (1):167–179

    Article  Google Scholar 

  10. Fleurent C, Ferland JA (1994) Genetic hybrids for the quadratic assignment problem. Quadratic Assignment Related Probl 16:173–187

    Article  MathSciNet  Google Scholar 

  11. Forghani K, Mohammadi M, et al. (2012) Integrated quadratic assignment and continuous facility layout problem. Int J Ind Eng Comput 3(5):787–806

    Google Scholar 

  12. Gambardella LM, Taillard E. ́D., Dorigo M (1999) Ant colonies for the quadratic assignment problem. J Oper Res Soc 50(2):167–176

    Article  Google Scholar 

  13. Garey MR, Johnson DS, Stockmeyer L (1974) Some simplified np-complete problems. In: Proceedings of the sixth annual ACM symposium on Theory of computing, pp 47–63

  14. Hadley SW, Rendl F, Wolkowicz H (1992) A new lower bound via projection for the quadratic assignment problem. Math Oper Res 17(3):727–739

    Article  MathSciNet  Google Scholar 

  15. Hahn PM, Krarup J (2001) A hospital facility layout problem finally solved. J Intell Manuf 12(5-6):487–496

    Article  Google Scholar 

  16. James T, Rego C, Glover F (2009) A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur J Oper Res 195(3):810–826

    Article  Google Scholar 

  17. Kim J, Kim YD (1999) A branch and bound algorithm for locating input and output points of departments on the block layout. J Oper Res Soc 50(5):517–525

    Article  Google Scholar 

  18. Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econometrica 53–76

  19. Kusiak A, Heragu SS (1987) The facility layout problem. Eur J Oper Res 29(3):229–251

    Article  MathSciNet  Google Scholar 

  20. Li Y, Pardalos PM (1992) Generating quadratic assignment test problems with known optimal permutations. Comput Optim Appl 1(2):163–184

    Article  MathSciNet  Google Scholar 

  21. Lim WL, Wibowo A, Desa MI, Haron H (2016) A biogeography-based optimization algorithm hybridized with tabu search for the quadratic assignment problem. Comput Intell Neurosci 2016

  22. Nugent CE, Vollmann TE, Ruml J (1968) An experimental comparison of techniques for the assignment of facilities to locations. Oper Res 16(1):150–173

    Article  Google Scholar 

  23. Ramkumar A, Ponnambalam S, Jawahar N (2009) A population-based hybrid ant system for quadratic assignment formulations in facility layout design. Int J Adv Manuf Technol 44(5-6):548– 558

    Article  Google Scholar 

  24. Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM (JACM) 23(3):555–565

    Article  MathSciNet  Google Scholar 

  25. Singh SP (2009) Solving facility layout problem: three-level tabu search metaheuristic approach. Int J Recent Trends Eng 1(1):73

    Google Scholar 

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

    Article  Google Scholar 

  27. Stanevičienė E, Misevičius A, Ostreika A (2019) Experimental analysis of hybrid genetic algorithm for the grey pattern quadratic assignment problem. Inf Technol Control 48(2):335– 356

    Article  Google Scholar 

  28. Steinberg L (1961) The backboard wiring problem: A placement algorithm. Siam Rev 3(1):37–50

    Article  MathSciNet  Google Scholar 

  29. Taillard É (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17(4-5):443–455

    Article  MathSciNet  Google Scholar 

  30. Talbi EG, Roux O, Fonlupt C, Robillard D (2001) Parallel ant colonies for the quadratic assignment problem. Futur Gener Comput Syst 17(4):441–449

    Article  Google Scholar 

  31. Thonemann UW, Bolte A (1994) An improved simulated annealing algorithm for the quadratic assignment problem. Technical Report, Department of Production and Operations Research, University of Paderborn, Allemagne

  32. Tosun U, Dokeroglu T, Cosar A (2013) A robust island parallel genetic algorithm for the quadratic assignment problem. Int J Prod Res 51(14):4117–4133

    Article  Google Scholar 

  33. Xie W, Sahinidis NV (2008) A branch-and-bound algorithm for the continuous facility layout problem. Comput Chem Eng 32(4-5):1016–1028

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RECITS Laboratory, Faculty of Mathematics, USTHB University, Algiers, Algeria

    Soumaya Lakehal

  2. RECITS Laboratory, Faculty of Electronics and Computer Science (FEI), Department of Computer Science, USTHB University, Algiers, Algeria

    Abdelhakim Aitzai

  3. CReSTIC, IUT Reims, URCA University, Reims, France

    Fatima Ghedjati

Authors
  1. Soumaya Lakehal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdelhakim Aitzai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fatima Ghedjati
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soumaya Lakehal.

Ethics declarations

Ethical approval

The authors state that the submitted work is original, the manuscript in part or in full has not been submitted or published anywhere and it will not be submitted elsewhere until the editorial process is completed.

The author affirm that the results are presented without fabrication and ensure that all the authors mentioned in the manuscript have agreed for authorship, read and approved the manuscript, and given consent for submission and subsequent publication of the manuscript. All named authors agree the order of authorship.

Consent for publication

Publisher: Springer

Journal: International Journal of Advanced Manufacturing Technology IJAMT

Title of contribution: Parallel hybrid BBO-TS algorithm for QAP-formulation of FLP

The Work’s author or authors: Lakehal Soumaya, RECITS Laboratory, Faculty of Mathematics, USTHB University, Algiers, Algeria.

Aitzai Abdelhakim, RECITS Laboratory, Faculty of Electronics and Computer Science (FEI), Department of Computer Science, USTHB University, Algiers, Algeria.

Ghedjati Fatima, CReSTIC, IUT Reims, URCA University, Reims, France.

The author grants the Publisher permission to publish the Work named Parallel hybrid BBO-TS algorithm for QAP-formulation of FLP. The author properly authorizes its dissemination in various forms, and permits the conversion of the Work into machine-readable form; and by storage of the Work in electronic databases.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Authors’ contributions

Dr. Aitzai Abdelhakim is the principal advisor and he conceived and designed the study. Ms. Lakehal Soumaya conducted the experiments, collected the data and wrote the manuscript. Dr. Ghedjati Fatima contributed by providing access to the computing software and resources. All authors contributed to the manuscript revision and approve the final version of manuscript.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lakehal, S., Aitzai, A. & Ghedjati, F. Parallel hybrid BBO-TS algorithm for QAP-formulation of FLP. Int J Adv Manuf Technol 117, 3189–3209 (2021). https://doi.org/10.1007/s00170-021-07000-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-021-07000-x

Keywords

Search

Navigation