完整後設資料紀錄
DC 欄位語言
dc.contributor.authorWu, Tai-Hsien_US
dc.contributor.authorChung, Shu-Hsingen_US
dc.contributor.authorChang, Chin-Chihen_US
dc.date.accessioned2014-12-08T15:48:26Z-
dc.date.available2014-12-08T15:48:26Z-
dc.date.issued2010-09-01en_US
dc.identifier.issn0377-2217en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.ejor.2010.01.020en_US
dc.identifier.urihttp://hdl.handle.net/11536/32276-
dc.description.abstractAvailable research on the manufacturing cell formation problem shows that most solution approaches are either single- or multiple-solution-agent-based, with a fixed size of solution agents. Frequent problems encountered during the process of solving the cell formation problem include solutions being easily trapped in local optima and bad solution efficiency. Yang and Wang [Yang, F.-C., Wang, Y.-P., 2007. Water flow-like algorithm for object grouping problems. journal of the Chinese Institute of Industrial Engineers, 24(6). 475-488] proposed the water flow-like algorithm (WFA) to overcome the shortcomings of single- and multiple-solution-agent-based algorithms. WFA has the features of multiple and dynamic numbers of solution agents, and its mimicking of the natural behavior of water flowing from higher to lower levels coincides exactly with the process of searching for optimal solutions. This paper therefore adopts the WFA logic and designs a heuristic algorithm for solving the cell formation problem. Computational results obtained from running a set of 37 test instances from the literature and newly created have shown that the proposed algorithm has performed better than other benchmarking approaches both in solution effectiveness and efficiency, especially in large-sized problems. The superiority of the proposed WFACF over other approaches from the literature should be attributed to the collaboration of the WFA logic, the proposed prior estimation of the cell size, and the insertion-move. The WFA is a novel heuristic approach that deserves more attention. More attempts on adopting the WFA logic to solve many other combinatorial optimization problems are highly recommended. (C) 2010 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectManufacturingen_US
dc.subjectHeuristicsen_US
dc.subjectCell formationen_US
dc.subjectMeta-heuristicsen_US
dc.titleA water flow-like algorithm for manufacturing cell formation problemsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.ejor.2010.01.020en_US
dc.identifier.journalEUROPEAN JOURNAL OF OPERATIONAL RESEARCHen_US
dc.citation.volume205en_US
dc.citation.issue2en_US
dc.citation.spage346en_US
dc.citation.epage360en_US
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
dc.identifier.wosnumberWOS:000276030200013-
dc.citation.woscount11-
顯示於類別:期刊論文


文件中的檔案:

  1. 000276030200013.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。