Development of new features of ant colony optimization for flowshop scheduling

Miao-Tsong Lin*, C. Y. Lu, S. J. Shyu, C. Y. Tsai

*Corresponding author for this work

研究成果: Article同行評審

36 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)742-755
頁數14
期刊International Journal of Production Economics
112
發行號2
DOIs
出版狀態Published - 四月 2008

指紋 深入研究「Development of new features of ant colony optimization for flowshop scheduling」主題。共同形成了獨特的指紋。

引用此