{"title":"Combining Ant Colony Optimization and Dynamic Programming for Solving a Dynamic Facility Layout Problem","authors":"A. Udomsakdigool, S. Bangsaranthip","volume":40,"journal":"International Journal of Industrial and Manufacturing Engineering","pagesStart":379,"pagesEnd":384,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/7157","abstract":"This paper presents an algorithm which\r\ncombining ant colony optimization in the dynamic\r\nprogramming for solving a dynamic facility layout problem.\r\nThe problem is separated into 2 phases, static and dynamic\r\nphase. In static phase, ant colony optimization is used to find\r\nthe best ranked of layouts for each period. Then the dynamic\r\nprogramming (DP) procedure is performed in the dynamic\r\nphase to evaluate the layout set during multi-period planning\r\nhorizon. The proposed algorithm is tested over many\r\nproblems with size ranging from 9 to 49 departments, 2 and 4\r\nperiods. The experimental results show that the proposed\r\nmethod is an alternative way for the plant layout designer to\r\ndetermine the layouts during multi-period planning horizon.","references":"[1] R.H. Shore and J.A. Tompkins, \"Flexible facilities design,\" AIIE\r\nTransactions, 1980, vol.12, pp. 200-205.\r\n[2] M.J. Rosenblatt, \" The dynamics of plant layout,\" Management Science,\r\n1986, vol. 32, pp. 76- 86.\r\n[3] T.L. Urban, \"A heuristic for the dynamic facility layout problem,\" IIE\r\nTransactions, 1993, vol. 25, pp. 57-63.\r\n[4] D. G. Conway, M. A. Venkataramanan, \"Genetic search and the\r\ndynamic facility layout problem,\" Computers & Operations Research,\r\n1994, vol. 2, no. 8, pp. 955-960.\r\n[5] B. K. Kaku and J. B. Mazzola, \"A tabu search heuristic for the dynamic\r\nplant layout problem,\" INFORMS Journal on Computing , 1997, vol. 9,\r\nno. 4, pp. 374-384.\r\n[6] J. Balakrishnan, C. H. Cheng and G. Conway, \"An improved pair-wise\r\nexchange heuristic for the dynamic plant layout problem,\" International\r\nJournal of Production Research, 2000, vol. 38, no. 13, pp. 3067-3077.\r\n[7] A. Baykasoglu and N. Z. Z. Gindy, \"A simulated annealing algorithm\r\nfor dynamic facility layout problem,\" Computers&Operations Research,\r\n2001, vol.28, no. 14, pp. 1403-1426.\r\n[8] J. Balakrishnan, C. H. Cheng, G. Conway and C. M. Lau, \"A hybrid\r\ngenetic algorithm for the dynamic plant layout problem,\" International\r\nJournal of Production Economics, 2003, vol. 86, pp. 107-120.\r\n[9] D. Thomas, R. G\u251c\u255dnter, and W. Engelbert, \" Combining evolutionary\r\ncomputation and dynamic programming for solving a dynamic facility\r\nlayout problem,\" European Journal of Operational Research, 2005, vol.\r\n165, pp. 55-69.\r\n[10] A.R. McKendall Jr, S. Jin, and K. Saravanan, \"Simulated annealing\r\nheuristics for the dynamic facility layout problem,\" Computers &\r\nOperations Research, 2006, vol.33, pp. 2431-2444.\r\n[11] J. Balakrishnana, and C. H. Cheng, \"The dynamic plant layout problem:\r\nIncorporating rolling horizons and forecast uncertainty,\" Omega, 2009,\r\nvol. 37, pp. 165 - 177.\r\n[12] J. Balakrishnan, C. H. Cheng, \"Dynamic layout algorithms: a state-ofthe-\r\nart survey,\" Omega, International Journal of Management Sciences,\r\n1998, vol. 26, pp. 507-521.\r\n[13] A. Baykasoglu, T. Dereli, and I. Sabuncu, \"An ant colony algorithm for\r\nsolving budget constrained and unconstrained dynamic facility layout\r\nproblems,\" Omega, 2006, vol. 34, no. 4, pp. 385-396.\r\n[14] A. R. McKendall Jr., and J. Shang , \" Hybrid ant systems for the\r\ndynamic facility layout problem,\" Computers & Operations Research,\r\n2006, vol. 33, no. 3, pp.790-803.\r\n[15] M. Dorigo, and T. St\u251c\u255dtzle, \"Ant colony optimization\" The MIT Press,\r\nMassachusetts, Cambridge, MA, 2004.","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 40, 2010"}