Skip to main content
SpringerLink
Log in

Hybrid imperialist competitive algorithm, variable neighborhood search, and simulated annealing for dynamic facility layout problem

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Today’s manufacturing plants tend to be more flexible due to rapid changes in product mix and market demand. Therefore, this paper investigates the problem of location and relocation (when there are changes incurred to the material flows between departments) manufacturing facilities such that the total cost of material flows and relocation costs are minimized. This problem is known as the dynamic facility layout problem (DFLP), which is a general case of static facility layout problem. This paper proposes a robust and simply structured hybrid technique based on integrating three meta-heuristics: imperialist competitive algorithms, variable neighborhood search, and simulated annealing, to efficiently solve the DFLP. The novel aspect of the proposed algorithm is taking advantage of features of all above three algorithms together. To test the efficiency of our algorithm, a data set from the literature is used for the experimental purpose. The results obtained are quite promising in terms of solution quality for most of the test problems.

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
Fig. 17
Fig. 18

Similar content being viewed by others

References

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

    Article  MathSciNet  Google Scholar 

  2. Connolly DT (1990) An improved annealing scheme for the QAP. Eur J Oper Res 46(1):93–100

    Article  MATH  MathSciNet  Google Scholar 

  3. Clausen J, Perregaard M (1997) Solving large quadratic assignment problem in parallel. Comput Optim Appl 8(2):111–127

    Article  MATH  MathSciNet  Google Scholar 

  4. Mills P, Tsang EPE, Ford J (2003) Applying an extended guided local search on the quadratic assignment problem. Ann Oper Res 118(1–4):121–135

    Article  MATH  MathSciNet  Google Scholar 

  5. Lacksonen TA, Enscore EE (1993) Quadratic assignment algorithms for the dynamic layout problem. Int J Prod Res 31(3):503–517

    Article  Google Scholar 

  6. Rosenblatt MJ (1986) The dynamics of plant layout. Manag Sci 32(1):76–86

    Article  MATH  Google Scholar 

  7. Dunker T, Radons G, Westkamper E (2005) Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem. Eur J Oper Res 165(1):55–69

    Article  MATH  MathSciNet  Google Scholar 

  8. Baykasoglu A, Gindy NNZ (2001) A simulated annealing for dynamic facility layout problem. Comput Oper Res 28(14):1403–1426

    Article  MATH  MathSciNet  Google Scholar 

  9. Balakrishnan J, Cheng CH, Conway DG, Lau CM (2003) A hybrid genetic algorithm for the dynamic plants layout problem. Int J Prod Econ 86(2):107–120

    Article  Google Scholar 

  10. McKendall AR, Shang J (2006) Hybrid ant systems for the dynamic facility layout problem. Comput Oper Res 33(3):790–803

    Article  MATH  MathSciNet  Google Scholar 

  11. McKendall AR, Shang J, Kuppusamy S (2006) Simulated annealing heuristics for the dynamic layout problem. Comput Oper Res 33(8):2431–2444

    Article  MATH  MathSciNet  Google Scholar 

  12. Baykasoglu A, Dereli T, Sabuncu I (2006) An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems. Omega 34(4):385–396

    Article  Google Scholar 

  13. Azimi P, Charmchi HR (2012) A new optimization via simulation approach for dynamic facility layout problem with budget constraints. Model Simul Eng. doi:10.1155/2012/189742

  14. Rezazadeh H, Ghazanfari M, Saidi-Mehrabadi M, Sadjadi AJ (2009) An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem. J Zhejiang Univ Sci A 10(4):520–529

    Article  MATH  Google Scholar 

  15. Chen GYH (2013) A new data structure of solution representation in hybrid ant colony optimization for large dynamic facility layout problems. Int J Prod Econ 142(2):362–371

    Article  Google Scholar 

  16. Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialist competition. In: IEEE congress evolutionary computation, pp 4661–4667

  17. Behnamian J, Zandieh M (2011) A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties. Expert Syst Appl 38(12):14490–14498

    Article  Google Scholar 

  18. Bagher M, Zandieh M, Farsijani H (2011) Balancing of stochastic U-type assembly lines: an imperialist competitive algorithm. Int J Adv Manuf Technol 54(1–4):271–285

    Article  Google Scholar 

  19. Yousefi M, Darus AN, Mohammadi H (2012) An imperialist competitive algorithm for optimal design of plate-fin heat exchangers. Int J Heat Mass Transf 55(11–12):3178–3185

    Article  Google Scholar 

  20. Duan H, Xu C, Liu S, Shao S (2010) Template matching using chaotic imperialist competitive algorithm. Pattern Recognit Lett 3(13):1868–1875

    Article  Google Scholar 

  21. Lian K, Zhang C, Gao L, Shao X (2012) A modified colonial competitive algorithm for the mixed-model U-line balancing sequencing problem. Int J Prod Res 50(18):5117–5131

    Article  Google Scholar 

  22. Mohammadi M, Jolai F, Rostami H (2011) An M/M/c queue model for hub covering location problem. Math Comput Model 54(11):2623–2638

    Article  MATH  MathSciNet  Google Scholar 

  23. Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097–1100

    Article  MATH  MathSciNet  Google Scholar 

  24. Hansen P, Mladenovic N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449–467

    Article  MATH  MathSciNet  Google Scholar 

  25. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  MATH  MathSciNet  Google Scholar 

  26. Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, New York

    Google Scholar 

  27. Ruiz R, Maroto C, Alcaraz J (2006) Two new robust genetic algorithm for the flow shop scheduling problem. Omega 34(5):461–476

    Article  Google Scholar 

  28. Schaffer JD, Caruana RA, Eshelman L, Da R (1989) A study of control parameters affecting online performance of genetic algorithms for function optimization. In: 3rd international conference on genetics, pp 51–60

  29. Cochran WG, Cox GM (1992) Experimental designs, 2nd edn. Wiley, USA

    MATH  Google Scholar 

  30. Phadke MS (1989) Quality engineering using robust design. Prentice-Hall, Upper Saddle River

    Google Scholar 

  31. Erel E, Ghosh JB, Simon JT (2003) New heuristic for the dynamic layout problem. J Oper Res Soc 54(12):1275–1282

    Article  MATH  Google Scholar 

Download references

Acknowledgments

The authors extend their sincere gratitude to the anonymous reviewers for their constructive and valuable suggestions which helped to improve the content of the paper.

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, Mississippi State University, Mississippi State, MS, USA

    Seyedmohsen Hosseini, Abdullah Al Khaled & Satish Vadlamani

  2. Department of Industrial and Systems Engineering, University of Oklahoma, Norman, OK, USA

    Seyedmohsen Hosseini

Authors
  1. Seyedmohsen Hosseini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdullah Al Khaled
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Satish Vadlamani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyedmohsen Hosseini.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hosseini, S., Khaled, A.A. & Vadlamani, S. Hybrid imperialist competitive algorithm, variable neighborhood search, and simulated annealing for dynamic facility layout problem. Neural Comput & Applic 25, 1871–1885 (2014). https://doi.org/10.1007/s00521-014-1678-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-014-1678-x

Keywords

Search

Navigation