微型机与应用Issue(12)：66-68,72,4.
改进的蚁群算法求解置换流水车间调度问题
Improved ant colony algorithm for permutation flow shop scheduling problem
张丽萍1
作者信息
- 1. 青岛科技大学 信息科学技术学院，山东 青岛 266061
- 折叠
摘要
Abstract
In order to avoid the shortcomings of ant algorithm for solving permutation flow shop scheduling problem that easily fall into local best situation and long calculation time, in this paper, an improved Max-Min Ant System (MMAS)algorithm which apply Nawaz-Enscore-Ham ( NEH ) heuristic algorithm to enhance the quality of the initial solutions and further improve the search capabil-ities through regulation of adaptive strategies is proposed . Finally we use the proposed algorithm to solve Taillard benchmarks set . Compared with other approaches , the experimental results show the effectiveness of the proposed algorithm .关键词
置换流水车间调度问题/自适应/NEH 启发式算法Key words
permutation flow shop scheduling problem/adaptive/NEH heuristic algorithm分类
信息技术与安全科学引用本文复制引用
张丽萍..改进的蚁群算法求解置换流水车间调度问题[J].微型机与应用,2014,(12):66-68,72,4.
