DocumentCode
3227792
Title
A novel Ant algorithm for permutation flow shop problem
Author
Yang, Wenjin ; Zhou, Yantao ; Li, Kenli
Author_Institution
Dept. of Comput. Sci., Hunan Univ., Changsha, China
fYear
2010
fDate
23-26 Sept. 2010
Firstpage
1093
Lastpage
1097
Abstract
A new ant algorithm for the permutation flow shop problem is presented, which embraces two new features. One is a different yet outstanding pheromone structure, in which an ant is permitted to select more than one jobs at each step when constructing a complete travel sequence. The other is a new heuristic to guide the search. Experiments shows that a considerable improvement of performance can be obtained, and the reason behind is presented.
Keywords
flow shop scheduling; optimisation; ant algorithm; permutation flow shop problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010 IEEE Fifth International Conference on
Conference_Location
Changsha
Print_ISBN
978-1-4244-6437-1
Type
conf
DOI
10.1109/BICTA.2010.5645102
Filename
5645102
Link To Document