Metaheuristics for fuzzy dynamic facility layout problem with unequal area constraints and closeness ratings

  • Hamed Samarghandi
  • Pouria Taabayan
  • Mehdi Behroozi


Dynamic facility layout problem deals with the problem of arranging and rearranging the layout plan of a system throughout several periods. In each period, the material handling costs are different from the past period due to the change in the market demand and product mix. In this paper, the uncertainty that exists in transportation values’ forecast is modeled by fuzzy theory. In this paper, departments have unequal areas. This means that in each period, departments can be placed only in certain places due to different spacing requirements. In addition, closeness rating matrix is considered in order to model the goodness of different layout plans with regard to qualitative factors according to decision maker. Accordingly, fuzzy dynamic facility layout problem with unequal areas and closeness rating matrix is considered that aims to minimize the uncertain material handling costs as well as the shifting costs, and maximize closeness rating with regard to space requirements of unequal area departments. A number of fuzzy algorithms are developed in order to deal with the problem. A number of ranking criteria from the literature are implemented in order to compare the performance of the developed algorithms.


Fuzzy optimization Dynamic facility layout planning Unequal area Closeness rating Fuzzy metaheuristics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ahia A, Aryanezhad MB, Ashtiania B, Makui A (2009) A novel approach to determine cell formation, intracellular machine layout and cell layout in the CMS problem based on TOPSIS method. Comput Oper Res 36(5):1478–1496CrossRefGoogle Scholar
  2. 2.
    Balakrishnan J, Cheng C, Conway G (2000) An improved pair-wise exchange heuristic for the dynamic plant layout problem. Int J Prod Res 38(13):3067–3077CrossRefGoogle Scholar
  3. 3.
    Balakrishnan J, Cheng CH (1998) Dynamic layout algorithms: a state-of-the-art survey. Omega 26(4):507–521CrossRefGoogle Scholar
  4. 4.
    Balakrishnan J, Cheng CH (2009) The dynamic plant layout problem: incorporating rolling horizons and forecast uncertainty. Omega 37:165–177CrossRefGoogle Scholar
  5. 5.
    Ballou R (1968) Dynamic warehouse location analysis. J Mark Res 5(3):271–276CrossRefGoogle Scholar
  6. 6.
    Bashiri M, Dehghan E (2010) Optimizing a multiple criteria dynamic layout problem using a simultaneous data envelopment analysis modeling (optimizing a DLP using DEA). Int J Comput Sci Eng 2(1):28–35Google 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(4):385–396CrossRefGoogle Scholar
  8. 8.
    Celano G, Costa A, Fichera S (2003) An evolutionary algorithm for pure fuzzy flowshop scheduling problem. International Journal of Uncertainty, Fuzziness, and Knowledge-Based Systems 11(6):655–669MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Chen GY-H (2007) Multi-objective evaluation of dynamic facility layout using ant colony optimization. The University of Texas, Arlington, Ph.DGoogle Scholar
  10. 10.
    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:55–69MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Eberhart R. C., Kennedy J. (1995) A new optimizer using particle swarm theory. Sixth international symposium on micro machine and human science. Nagoya, JapanGoogle Scholar
  12. 12.
    Fortemps P (1997) Jobshop scheduling with imprecise duration: a fuzzy approach. IEEE Trans Fuzzy Syst 5:557–569CrossRefGoogle Scholar
  13. 13.
    Francis RL, McGinnis F, White JA (1998) Facility layout and location: an analytical approach. Prentice Hall, Englewoods CliffsGoogle Scholar
  14. 14.
    Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13:533–549MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Hong TP, Chuang TN (1999) A new triangular fuzzy Johnson algorithm. Comput Ind Eng 36:179–200CrossRefGoogle Scholar
  16. 16.
    Ishii H, Tada M, Masuda T (1992) Two scheduling problems with fuzzy due dates. Fuzzy Set Syst 46:339–347MathSciNetMATHCrossRefGoogle Scholar
  17. 17.
    Kennedy J, Eberhart RC (1997). A discrete binary version of the particle swarm algorithm. IEEE International Conference on Systems, Man, and CyberneticsGoogle Scholar
  18. 18.
    Kusiak A, Heragu SS (1987) The facility layout problem. Eur J Oper Res 29(3):229–251MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Lacksonen T (1994) Static and dynamic layout problems with varying areas. J Oper Res Soc 45(1):59–69MATHGoogle Scholar
  20. 20.
    Lacksonen T, Enscore E (1993) Quadratic assignment algorithms for the dynamic layout problem. Int J Prod Res 31(3):503–517CrossRefGoogle Scholar
  21. 21.
    Lootsma FA (1997) Fuzzy logic for planning and decision making. Kluwer, DordrechtMATHCrossRefGoogle Scholar
  22. 22.
    Lorenzo RD, Fichera S, Grasso V (1998) Scheduling a cellular manufacturing system with GA. Proceeding of International conference on Conventional and Knowledge-based Electronics Systems (KES), South AustraliaGoogle Scholar
  23. 23.
    MacCahon CS, Lee ES (1992) Fuzzy job sequencing for flow shop. Eur J Oper Res 62:294–301CrossRefGoogle Scholar
  24. 24.
    McKendall A, Shang J, Kuppusamy S (2006) Simulated annealing heuristics for the dynamic facility layout problem. Comput Oper Res 33(3):790–803MathSciNetMATHCrossRefGoogle Scholar
  25. 25.
    McKendall AR, Hakobyan A (2010) Heuristics for the dynamic facility layout problem with unequal-area departments. Eur J Oper Res 201:171–182MATHCrossRefGoogle Scholar
  26. 26.
    Meller RD, Gau KY (1996) The facility layout problem: recent and emerging trends and perspectives. J Manuf Syst 15(5):351–366CrossRefGoogle Scholar
  27. 27.
    Mladenovic N (1995) A variable neighborhood algorithm—a new metaheuristic for combinatorial optimization. Optimization Days. Montreal. 112Google Scholar
  28. 28.
    Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100MathSciNetMATHCrossRefGoogle Scholar
  29. 29.
    Montreuil B, Venkatadri U (1990) Strategic interpolative design of dynamic manufacturing system layouts. Manag Sci 37:272–286Google Scholar
  30. 30.
    Ozelkan CO, Duckstein L (1999) Optimal fuzzy counterparts of scheduling rules. Eur J Oper Res 113:593–609CrossRefGoogle Scholar
  31. 31.
    Rezazadeh H, Ghazanfari M, Saidi-Mehrabad M, Sadjadi SJ (2009) An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem. J Zhejiang Univ 10(4):520–529MATHCrossRefGoogle Scholar
  32. 32.
    Rochat Y, Taillard E (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1:147–167MATHCrossRefGoogle Scholar
  33. 33.
    Rodriguez, JG (2005) An algorithm for the solution of the dynamic plant layout problem. Department of Mechanical Engineering. Canada, The University of Brunswick. Ph.D. ThesisGoogle Scholar
  34. 34.
    Rosenblatt M (1986) The dynamics of plant layout. Manag Sci 32(1):76–86MATHCrossRefGoogle Scholar
  35. 35.
    Şahin R (2011) A simulated annealing algorithm for solving the bi-objective facility layout problem. Expert Syst Appl 38(4):4460–4465CrossRefGoogle Scholar
  36. 36.
    Samarghandi H, Jahantigh FF (2011) A particle swarm optimisation for fuzzy dynamic facility layout problem. Int J Metaheuristics 1(3):257–278MathSciNetGoogle Scholar
  37. 37.
    Shadrokh S, Kianfar F (2007) A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. Eur J Oper Res 181:86–101MathSciNetMATHCrossRefGoogle Scholar
  38. 38.
    Singh SP, Singh VK (2011) Three-level AHP-based heuristic approach for a multi-objective facility layout problem. Int J Prod Res 49(4):1105–1125CrossRefGoogle Scholar
  39. 39.
    Tompkins JA, White JA, Bozer YA, Frazelle EH, Tanchoco JMA, Trevino J (1996) Facilities planning. Wiley, New YorkGoogle Scholar
  40. 40.
    Ulutas BH, Islier AA (2008) A clonal selection algorithm for dynamic facility layout problems. J Manuf Syst 28(4):123–131CrossRefGoogle Scholar
  41. 41.
    Urban T (1993) A heuristic for the dynamic facility layout problem. IIE Trans 25(4):57–63CrossRefGoogle Scholar
  42. 42.
    Wena M, Iwamura K (2008) Facility location–allocation problem in random fuzzy environment: using (α, β)-cost minimization model under the Hurewicz criterion. Comput Math Appl 55(4):704–713MathSciNetCrossRefGoogle Scholar
  43. 43.
    Wena M, Iwamura K (2008) Fuzzy facility location-allocation problem under the Hurwicz criterion. Eur J Oper Res 184(2):627–635CrossRefGoogle Scholar
  44. 44.
    Yanagida T, Nonaka H (2009) Flexible widget layout formulated as fuzzy constraint satisfaction problem. New Advances in Intelligent Decision Technologies 199:73–83CrossRefGoogle Scholar
  45. 45.
    Yuan Y (1991) Criteria for evaluating fuzzy ranking methods. Fuzzy Set Syst 43(2):139–157MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag London 2012

Authors and Affiliations

  • Hamed Samarghandi
    • 1
  • Pouria Taabayan
    • 2
  • Mehdi Behroozi
    • 3
  1. 1.University of ManitobaWinnipegCanada
  2. 2.Iran University of Science and TechnologyTehranIran
  3. 3.University of MinnesotaMinneapolisUSA

Personalised recommendations