Development of new features of ant colony optimization for flowshop scheduling

被引:30
作者
Lin, B. M. T. [1 ]
Lu, C. Y. [2 ]
Shyu, S. J. [3 ]
Tsai, C. Y. [3 ]
机构
[1] Natl Chiao Tung Univ, Inst Informat Management, Dept Informat & Finance Management, Taipei 300, Taiwan
[2] Natl Chi Nan Univ, Dept Informat Management, Taipei 545, Taiwan
[3] Ming Chuan Univ, Dept Comp Sci & Informat Engn, Taipei 333, Taiwan
关键词
ant colony optimization; flowshop scheduling; total completion time; makespan; bicriteria;
D O I
10.1016/j.ijpe.2007.06.007
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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.
引用
收藏
页码:742 / 755
页数:14
相关论文
共 57 条
[1]  
[Anonymous], 1994, Journey To the Ants: A Story of Scientific Exploration
[2]  
[Anonymous], P ANTS 2000 2 INT WO
[3]  
Bauer A., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1445, DOI 10.1109/CEC.1999.782653
[4]   TRAILS AND U-TURNS IN THE SELECTION OF A PATH BY THE ANT LASIUS-NIGER [J].
BECKERS, R ;
DENEUBOURG, JL ;
GOSS, S .
JOURNAL OF THEORETICAL BIOLOGY, 1992, 159 (04) :397-415
[5]  
BRUCKER P, 1997, SCHEDULING ALGORITHM
[6]  
BULLNEIMER B, 1999, APPLYING ANT SYSTEM
[7]  
BULLNHEIMER B, 1999, 6 VIENN WORKSH OPT C, P21
[8]  
BULLNHEIMER B, 1998, HIGH PERFORMANCE ALG, V24, P87
[9]  
Cadambi B. V., 1993, Opsearch, V30, P35
[10]  
Colorni A., 1996, International Transactions in Operational Research, V3, P1, DOI 10.1111/j.1475-3995.1996.tb00032.x