A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach

References

• Aghassi M. 2005. Robust optimization, game theory, and variational inequalities [Ph.D. Dissertation]. Cambridge: Operations Research Center, MIT.
   Google Scholar
• Appa GM, Pitsoulis LS, Williams HP. 2006. Handbook on modelling for discrete optimization Vol. 88. Springer Science & Business Media.
   Google Scholar
• Balakrishnan J, Cheng CH. 2000. Genetic search and the dynamic layout problem. Comput Oper Res. 27(6):587–593.
   Web of Science ®Google Scholar
• Balakrishnan J, Cheng CH. 2006. A note on “a hybrid genetic algorithm for the dynamic plant layout problem”. Int J Prod Econ. 103(1):87–89.
   Web of Science ®Google Scholar
• Balakrishnan J, Cheng CH, Conway DG, Lau CM. 2003. A hybrid genetic algorithm for the dynamic plant layout problem. Int J Prod Econ. 86(2):107–120.
   Web of Science ®Google Scholar
• Balakrishnan J, Jacobs FR, Venkataramanan MA. 1992. Solutions for the constrained dynamic facility layout problem. Eur J Oper Res. 57(2):280–286.
   Web of Science ®Google Scholar
• 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.
   Web of Science ®Google Scholar
• Baykasoğlu A, Gindy NN. 2001. A simulated annealing algorithm for the dynamic layout problem. Comput Oper Res. 28(14):1403–1426.
   Web of Science ®Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A. 2009. Robust Optimization. Princeton and Oxford: Princeton University Press.
   Google Scholar
• Ben-Tal A, Nemirovski A. 1998. Robust convex optimization. Math Oper Res. 23(4):769–805.
   Web of Science ®Google Scholar
• Ben-Tal A, Nemirovski A. 2000. Robust solutions of linear programming problems contaminated with uncertain data. Math Program. 88(3):411–421.
   Web of Science ®Google Scholar
• Bertsimas D, Sim M. 2004. The price of robustness. Oper Res. 52(1):35–53.
   Web of Science ®Google Scholar
• Conway DG, Venkataramanan MA. 1994. Genetic search and the dynamic facility layout problem. Comput Oper Res. 21(8):955–960.
   Web of Science ®Google Scholar
• Dong M, Wu C, Hou F. 2009. Shortest path based simulated annealing algorithm for dynamic facility layout problem under dynamic business environment. Expert Syst Appl. 36(8):11221–11232.
   Web of Science ®Google Scholar
• El-Ghaoui L, Lebret H. 1997. Robust solutions to least-square problems to uncertain data matrices. SIAM J Matrix Anal & Appl. 18(4):1035–1064.
   Web of Science ®Google Scholar
• Erel E, Ghosh JB, Simon JT. 2003. New heuristic for the dynamic layout problem. J Oper Res Soc. 54(12):1275–1282.
   Web of Science ®Google Scholar
• Foulds LR, Robinson DF. 1978. Graph theoretic heuristics for the plant layout problem. Int J Prod Res. 16(1):27–37.
   Web of Science ®Google Scholar
• Jolai F, Tavakkoli-Moghaddam R, Taghipour M. 2012. A multi-objective particle swarm optimisation algorithm for unequal sized dynamic facility layout problem with pickup/drop-off locations. Int J Prod Res. 50(15):4279–4293.
   Web of Science ®Google Scholar
• Kaku BK, Mazzola JB. 1997. A tabu search heuristic for the dynamic plant layout problem. INFORMS J Comput. 9(4):374–384.
   Google Scholar
• Kaveh M, Dalfard VM, Amiri S. 2014. A new intelligent algorithm for dynamic facility layout problem in state of fuzzy constraints. Neural Comput & Applic. 24(5):1179–1190.
   Web of Science ®Google Scholar
• Kia R, Baboli A, Javadian N, Tavakkoli-Moghaddam R, Kazemi M, Khorrami J. 2012. Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing. Comput Oper Res. 39(11):2642–2658.
   Web of Science ®Google Scholar
• Kirkpatrick S, Gelatt CD, Vecchi MP. 1983. Optimization by simulated annealing. Science. 220(4598):671–680.
   PubMed Web of Science ®Google Scholar
• Krishnan KK, Cheraghi SH, Nayak CN. 2008. Facility layout design for multiple production scenarios in a dynamic environment. IJISE. 3(2):105–133.
   Google Scholar
• Kulturel-Konak S. 2007. Approaches to uncertainties in facility layout problems: perspectives at the beginning of the 21st Century. J Intell Manuf. 18(2):273–284.
   Web of Science ®Google Scholar
• Lin X, Floudas C, Kallrath J. 2005. Global solution approach for a Nonconvex MINLP Problem in Product Portfolio Optimization. J Glob Optim. 32(3):417–431.
   Web of Science ®Google Scholar
• McKendall AR, Shang J. 2006. Hybrid ant systems for the dynamic facility layout problem. Comput Oper Res. 33(3):790–803.
   Web of Science ®Google Scholar
• McKendall AR, Shang J, Kuppusamy S. 2006. Simulated annealing heuristics for the dynamic facility layout problem. Comput Oper Res. 33(8):2431–2444.
   Web of Science ®Google Scholar
• Moslemipour G, Lee TS. 2012. Intelligent design of a dynamic machine layout in uncertain environment of flexible manufacturing systems. J Intell Manuf. 23(5):1849–1860.
   Web of Science ®Google Scholar
• Moslemipour G, Lee TS, Rilling D. 2012. A review of intelligent approaches for designing dynamic and robust layouts in flexible manufacturing systems. Int J Adv Manuf Technol. 60(1-4):11–27.
   Web of Science ®Google Scholar
• Nahas N, Nourelfath M. 2016. Iterated great deluge for the dynamic facility layout problem. In: Metaheuristics for production systems. Cham: Springer; p. 57–92.
   Google Scholar
• Norman BA, Smith AE. 2006. A continuous approach to considering uncertainty in facility design. Comput Oper Res. 33(6):1760–1775.
   Web of Science ®Google Scholar
• Peng Y, Zeng T, Fan L, Han Y, Xia B. 2018. An improved genetic algorithm based robust approach for stochastic dynamic facility layout problem. Discrete Dyn Nat Soc. 2018:1–8.
   Web of Science ®Google Scholar
• Pillai VM, Hunagund IB, Krishnan KK. 2011. Design of robust layout for dynamic plant layout problems. Comput Ind Eng. 61(3):813–823.
   Web of Science ®Google Scholar
• Pourvaziri H, Naderi B. 2014. A hybrid multi-population genetic algorithm for the dynamic facility layout problem. Appl Soft Comput. 24:457–469.
   Web of Science ®Google Scholar
• Pourvaziri H, Pierreval H. 2017. Dynamic facility layout problem based on open queuing network theory. Eur J Oper Res. 259(2):538–553.
   Web of Science ®Google Scholar
• 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 Sci A. 10(4):520–529.
   Web of Science ®Google Scholar
• Ripon KSN, Glette K, Hovin M, Torresen J. 2011. Dynamic facility layout problem under uncertainty: a Pareto-optimality based multi-objective evolutionary approach. Cent European J Comput Sci. 1:375–386.
   Google Scholar
• Rosenblatt MJ. 1986. The dynamics of plant layout. Manage Sci. 32(1):76–86. (
   Web of Science ®Google Scholar
• Şahin R, Ertoğral K, Türkbey O. 2010. A simulated annealing heuristic for the dynamic layout problem with budget constraint. Comput Ind Eng. 59(2):308–313.
   Web of Science ®Google Scholar
• Şahin R, Türkbey O. 2009. A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem. Int J Prod Res. 47(24):6855–6873.
   Web of Science ®Google Scholar
• Samarghandi H, Taabayan P, Behroozi M. 2013. Metaheuristics for fuzzy dynamic facility layout problem with unequal area constraints and closeness ratings. Int J Adv Manuf Technol. 67(9–12):2701–2715.
   Web of Science ®Google Scholar
• Shi L, Olafsson S. 2000. Nested partitions method for global optimization. Oper Res. 48(3):390–407.
   Web of Science ®Google Scholar
• Shi L, Olafsson S, Chen Q. 1999. A new hybrid optimization algorithm. Comput Ind Eng. 36(2):409–426.
   Web of Science ®Google Scholar
• Soyster AL. 1973. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res. 21(5):1154–1157.
   Web of Science ®Google Scholar
• Tayal A, Gunasekaran A, Singh SP, Dubey R, Papadopoulos T. 2017. Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations. Ann Oper Res. 253(1):621–655.
   Web of Science ®Google Scholar
• Tompkins J, White J. 1984. Facilities planning. New Jersey: Wiley.
   Google Scholar
• Turanoğlu B, Akkaya G. 2018. A new hybrid heuristic algorithm based on bacterial foraging optimization for the dynamic facility layout problem. Expert Syst Appl. 98:93–104.
   Web of Science ®Google Scholar
• Ulutas B, Islier AA. 2015. Dynamic facility layout problem in footwear industry. J Manuf Syst. 36:55–61.
   Web of Science ®Google Scholar
• Ulutas BH, Islier AA. 2009. A clonal selection algorithm for dynamic facility layout problems. J Manuf Syst. 28(4):123–131.
   Web of Science ®Google Scholar
• Vitayasak S, Pongcharoen P, Hicks C. 2017. A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a genetic algorithm or modified Backtracking search algorithm. Int J Prod Econ. 190:146–157.
   Web of Science ®Google Scholar
• Xu J, Liu Q, Lei X. 2016. A fuzzy multi-objective model and application for the discrete dynamic temporary facilities location planning problem. J Civil Eng Manage. 22(3):357–372.
   Web of Science ®Google Scholar
• Xu J, Song X. 2015. Multi-objective dynamic layout problem for temporary construction facilities with unequal-area departments under fuzzy random environment. Knowledge-Based Syst. 81:30–45.
   Web of Science ®Google Scholar
• Yang T, Peters BA. 1998. Flexible machine layout design for dynamic and uncertain production environments. Eur J Oper Res. 108(1):49–64.
   Web of Science ®Google Scholar
• Yu CR, Luo Y. 2008. An improved nested partitions algorithm based on simulated annealing in complex decision problem optimization. WSEAS Trans Comput. 7(3):75–82.
   Google Scholar
• Zhu T, Balakrishnan J, Cheng CH. 2018. Recent advances in dynamic facility layout research. INFOR: Inf Syst Oper Res. 56(4):428–456.
   Web of Science ®Google Scholar