TY - GEN
T1 - An ant colony algorithm for permutation flow shop problem
AU - Shang, Ke
AU - Feng, Zuren
AU - Ke, Liangjun
PY - 2012
Y1 - 2012
N2 - In this paper, a new ant colony optimization algorithm, called finite grade ant colony optimization, is proposed to solve permutation flow shop problem, its main characteristic is that the updated quantities of pheromone trails are independent of objective function values, and the heuristic information provide by Moccellin is adopted. The developed algorithm has been applied to the benchmark problems given by Taillard, Comparison results demonstrate that the performance of the proposed algorithm is promising.
AB - In this paper, a new ant colony optimization algorithm, called finite grade ant colony optimization, is proposed to solve permutation flow shop problem, its main characteristic is that the updated quantities of pheromone trails are independent of objective function values, and the heuristic information provide by Moccellin is adopted. The developed algorithm has been applied to the benchmark problems given by Taillard, Comparison results demonstrate that the performance of the proposed algorithm is promising.
KW - ant colony algorithm
KW - finite grade pheromone
KW - permutation flow shop problem
UR - https://www.scopus.com/pages/publications/84872348121
U2 - 10.1109/WCICA.2012.6357949
DO - 10.1109/WCICA.2012.6357949
M3 - 会议稿件
AN - SCOPUS:84872348121
SN - 9781467313988
T3 - Proceedings of the World Congress on Intelligent Control and Automation (WCICA)
SP - 596
EP - 600
BT - WCICA 2012 - Proceedings of the 10th World Congress on Intelligent Control and Automation
T2 - 10th World Congress on Intelligent Control and Automation, WCICA 2012
Y2 - 6 July 2012 through 8 July 2012
ER -