Advertisement

The Heuristic Methods of Dynamic Facility Layout Problem

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 214)

Abstract

The hybrid heuristic simulation algorithms for dynamic facility layout problem (DFLP) have been proposed in this paper. By the combination of genetic algorithm and simulated annealing, we develop two heuristic methods and design the process of the algorithms with the forecasting and backtracking strategies in order to obtain the optimal solutions. Finally, a lot of experiments have been performed to reduce the random property of the algorithms. The simulation experiments have shown that the two combined heuristic algorithms proposed in this paper have much better performance than the other algorithms proposed in the reference when solving the sequential coding problem, especially in solving large-size problems.

Keywords

Dynamic facility layout problem (DFLP) Hybrid heuristic algorithms Forecasting and backtracking strategies 

Notes

Acknowledgments

This work was supported by Higher education specialized research fund for the doctoral program funding issue, China (No. 20100032110034).

References

  1. 1.
    Rosenblatt MJ (1986) The dynamics of plant layout. Manag Sci 37:272–286Google Scholar
  2. 2.
    Conway DG, Venkataramanan MA (1994) Genetic search and the dynamic facility layout problem. Comput Oper Res 21(8):955–960CrossRefMATHGoogle Scholar
  3. 3.
    Balakrishnan J, Cheng CH (2000) Genetic search and the dynamic layout problem: an improved algorithm. Comput Oper Res 27:587–593CrossRefMATHGoogle Scholar
  4. 4.
    Balakrishnan J, Cheng CH (2003) A hybrid genetic algorithm for the dynamic plant layout problem. Int J Prod Econ 86:107–120CrossRefGoogle Scholar
  5. 5.
    Balakrishnan J, Cheng CH (2009) The dynamic plant layout problem: incorporating rolling horizons and forecast uncertainty. Omega 37:165–177 Google Scholar
  6. 6.
    Urban TL (1998) Solution procedures for the dynamic facility layout problem. Anneals Oper Res 76:323–342CrossRefMATHGoogle Scholar
  7. 7.
    Baykasoglu A, Dereli T, Sabuncu I (2006) An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems. Omega 34:385–396CrossRefGoogle Scholar
  8. 8.
    Baykasoglu A, Gindy NNZ (2001) A simulated annealing algorithm for dynamic facility layout problem. Comput Oper Res 28:1367–1460MathSciNetCrossRefGoogle Scholar
  9. 9.
    Kulturel-Konak S (2007) Approaches to uncertainties in facility layout problems: perspectives at the beginning of the 21st century. J Intell Manuf 18:273–284CrossRefGoogle Scholar
  10. 10.
    McKendall AR, Shang J (2006) Hybrid ant systems for the dynamic facility layout problem. Comput Oper Res 33:790–803MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    McKendall AR Jr, Hakobyan A (2010) Heuristics for the dynamic facility layout problem with unequal-area departments. Eur J Oper Res 201:171–182CrossRefMATHGoogle Scholar
  12. 12.
    Drira A, Pierreval H, Hajri-Gabouj S (2007) Facility layout problems: a survey. Annu Rev Control 31(2):255–267CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.College of Management and EconomicsTianjin UniversityTianjinChina

Personalised recommendations