Multi-objective Flexible Job Shop Schedule Based on Improved Ant Colony Algorithm
Flexible job shop scheduling problem is a very important research in the field of combinatorial optimization. It is also important for practical production. A method for solving multi-objective flexible job shop scheduling problem based on ant colony algorithm is presented in this paper. Ant colony algorithm is improved from the following aspects in this paper: The number of subsets is defined by the number of jobs; A new method of constructing allowed set is given in this paper; An effective local search method is applied in the improved ant colony algorithm for searching a better scheduling. The problem of choosing suitable parameters for the improved ant colony algorithm is also discussed in this paper. The algorithm we presented is validated by practical instances. The results obtained have shown the proposed approach is feasible and effective for the multi-objective flexible job shop scheduling problem.
Li Li Keqi Wang
Information and Computer Engineering College,Northeast Forestry University,Harbin 150040,China Forestry Engineering Automation discipline,Northeast Forestry University,Harbin 150040,China
国际会议
2009 IEEE International Conference on Information and Automation(2009年 IEEE信息与自动化国际学术会议)
珠海、澳门
英文
1183-1187
2009-06-22（万方平台首次上网日期，不代表论文的发表时间）