A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem
作者： Ramazan Şahin , Orhan Türkbey
DOI: 10.1080/00207540802376323
关键词: Algorithm 、 Time horizon 、 Mathematical optimization 、 Heuristic (computer science) 、 Simulated annealing 、 Engineering 、 Data set 、 Tabu search 、 Metamodeling 、 Search algorithm 、 Facility layout problem
摘要: In today's market conditions of increasing global competition, rapid changes in technology and shorter life cycle product, it is required to evaluate the facility layout as dynamic problem (DFLP). The objective DFLP determine layouts for each period planning horizon such that sum material handling rearrangement costs are minimised. literature several researchers proposed new algorithms models solve problem. purpose this research present a hybrid heuristic based on simulated annealing (SA) approach supplemented with tabu list DFLP. We call TABUSA. efficiency TABUSA algorithm analysed by solving problems well known data set from literature. have also solved same using pure SA algorithm, search (TS) comparison purposes. results show effectiveness algorithm.
sci-hub.se 参考文章(25)
Jaydeep Balakrishnan, Chun Hung Cheng, Dynamic layout algorithms: a state-of-the-art survey Omega-international Journal of Management Science. ,vol. 26, pp. 507- 521 ,(1998) , 10.1016/S0305-0483(97)00078-9
Russell D. Meller, Kai-Yin Gau, The facility layout problem: Recent and emerging trends and perspectives Journal of Manufacturing Systems. ,vol. 15, pp. 351- 366 ,(1996) , 10.1016/0278-6125(96)84198-7
Jaydeep Balakrishnan, Chun Hung Cheng, Daniel G Conway, Chun Ming Lau, A Hybrid Genetic Algorithm for the Dynamic Plant Layout Problem International Journal of Production Economics. ,vol. 86, pp. 107- 120 ,(2003) , 10.1016/S0925-5273(03)00027-6
S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by Simulated Annealing Science. ,vol. 220, pp. 671- 680 ,(1983) , 10.1126/SCIENCE.220.4598.671
E Erel, J B Ghosh, J T Simon, New heuristic for the dynamic layout problem Journal of the Operational Research Society. ,vol. 54, pp. 1275- 1282 ,(2003) , 10.1057/PALGRAVE.JORS.2601646
Daniel G. Conway, M.A. Venkataramanan, Genetic search and the dynamic facility layout problem Computers & Operations Research. ,vol. 21, pp. 955- 960 ,(1994) , 10.1016/0305-0548(94)90023-X
Alan R. McKendall, Jin Shang, Hybrid ant systems for the dynamic facility layout problem Computers & Operations Research. ,vol. 33, pp. 790- 803 ,(2006) , 10.1016/J.COR.2004.08.008
TIMOTHY L. URBAN, A HEURISTIC FOR THE DYNAMIC FACILITY LAYOUT PROBLEM Iie Transactions. ,vol. 25, pp. 57- 63 ,(1993) , 10.1080/07408179308964304
Andrew Kusiak, Sunderesh S. Heragu, The facility layout problem European Journal of Operational Research. ,vol. 29, pp. 229- 251 ,(1987) , 10.1016/0377-2217(87)90238-4
De-fu Zhang, An-sheng Deng, An effective hybrid algorithm for the problem of packing circles into a larger containing circle Computers & Operations Research. ,vol. 32, pp. 1941- 1951 ,(2005) , 10.1016/J.COR.2003.12.006