改进的蚁群算法求解置换流水车间调度问题OA
Improved ant colony algorithm for permutation flow shop scheduling problem
针对蚂蚁算法在求解置换流水车间调度问题时易陷入局部最优以及计算时间较长的缺点，对最大最小蚂蚁系统( MMAS )进行了改进。在该算法中，采用 NEH 启发式算法提高初始解质量，并通过自适应的调节策略进一步提高蚁群算法的搜索能力。运用提出的混合算法求解 Taillard 基准测试集，并将测试结果与其他算法进行比较，验证了该调度算法的有效性。
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 u…查看全部>>
张丽萍
青岛科技大学 信息科学技术学院，山东 青岛 266061
计算机与自动化
置换流水车间调度问题自适应NEH 启发式算法
permutation flow shop scheduling problemadaptiveNEH heuristic algorithm
《微型机与应用》 2014 (12)
66-68,72,4
评论