Development of new features of ant colony optimization for flowshop scheduling
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
755 | en_US |
dc.citation.issue |
2 | en_US |
dc.citation.spage |
742 | en_US |
dc.citation.volume |
112 | en_US |
dc.citation.woscount |
14 | |
dc.contributor.author |
Lin, B. M. T. | en_US |
dc.contributor.author |
Lu, C. Y. | en_US |
dc.contributor.author |
Shyu, S. J. | en_US |
dc.contributor.author |
Tsai, C. Y. | en_US |
dc.contributor.department |
資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department |
Department of Information Management and Finance | en_US |
dc.date.accessioned |
2014-12-08T15:12:24Z | |
dc.date.available |
2014-12-08T15:12:24Z | |
dc.date.issued |
2008-04-01 | en_US |
dc.description.abstract |
Ant colony optimization (ACO) is a meta-heuristic based on the indirect communication of a colony of artificial ants mediated by pheromone trails with the collaboration and knowledge-sharing mechanism during their food-seeking process. In this study, we introduce two new features that are inspired from real ant behavior to develop a new ACO algorithm to produce better solutions. The proposed ACO algorithm is applied to two NP-hard flowshop scheduling problems. The first problem is to minimize the total completion time and the second is to minimize a combination of makespan and total completion time. Numerical results indicate that the proposed new features of ACO are very effective and the synergy of combining all the new features for the proposed ACO algorithm can solve the two problems to a certain scale by producing schedules of better quality. (C) 2007 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.ijpe.2007.06.007 | en_US |
dc.identifier.issn |
0925-5273 | en_US |
dc.identifier.journal |
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.ijpe.2007.06.007 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/9526 | |
dc.identifier.wosnumber |
WOS:000254982500018 | |
dc.language.iso |
en_US | en_US |
dc.subject |
ant colony optimization | en_US |
dc.subject |
flowshop scheduling | en_US |
dc.subject |
total completion time | en_US |
dc.subject |
makespan | en_US |
dc.subject |
bicriteria | en_US |
dc.title |
Development of new features of ant colony optimization for flowshop scheduling | en_US |
dc.type |
Article | en_US |
檔案
- 000254982500018.pdf (241.6 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Lin, B. M. T., Lu, C. Y., Shyu, S. J., & Tsai, C. Y. (2008). Development of new features of ant colony optimization for flowshop scheduling. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 112(2), 742–755. https://doi.org/10.1016/j.ijpe.2007.06.007
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/9526