Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (24): 216-219.

• 工程与应用 • Previous Articles     Next Articles

Application of mutating ant colony optimization algorithm on flow-shop scheduling problem

MEI Hong-biao1,2,WANG Jian1   

  1. 1.CIMS Research Centre,Tongji University,Shanghai 201804,China
    2.Application Academy of Jiangxi University of Science and Technology,Ganzhou,Jiangxi 341000,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-08-21 Published:2007-08-21
  • Contact: MEI Hong-biao

变异蚁群优化算法在流水作业排序中的应用

梅宏标1,2,王 坚1   

  1. 1.同济大学 CIMS研究中心,上海 201804
    2.江西理工大学 应用科学学院,江西 赣州 341000
  • 通讯作者: 梅宏标

Abstract: In solving FSSP,the unlocking element and the rate of pheromone evaporating as heuristic information and local optimization used are to develop the basic ACS(Ant Colony System) to solve the problems of premature convergence and two long time in it.And the results of simulation show that the advanced ACS is good at solving the FSSP.

Key words: ant colony algorithm, grouping algorithm, scheduling, optimization algorithm

摘要: 在采用蚁群算法求解流水作业排序中,针对蚁群算法存在的时间过长及过早收敛问题,使用解锁素及信息素挥发率作为启发式信息并引入局部优化,对蚁群系统加以改进。计算机仿真结果表明,改进后的蚁群系统对流水作业优化调度有较好的效果。

关键词: 蚁群算法, 组合算法, 排序, 优化算法