標題: Development of new features of ant colony optimization for flowshop scheduling
作者: Lin, B. M. T.
Lu, C. Y.
Shyu, S. J.
Tsai, C. Y.
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
關鍵字: ant colony optimization;flowshop scheduling;total completion time;makespan;bicriteria
公開日期: 1-Apr-2008
摘要: 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.
URI: http://dx.doi.org/10.1016/j.ijpe.2007.06.007
http://hdl.handle.net/11536/9526
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2007.06.007
期刊: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Volume: 112
Issue: 2
起始頁: 742
結束頁: 755
Appears in Collections:Articles


Files in This Item:

  1. 000254982500018.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.