摘要
研究了基于机器最短加工时间的一类车间作业调度问题,建立了多约束的数学模型,为解决蚁群算法收敛性差和易陷入局部最优的问题,提出了一种基于插入移动的领域搜索方法,并使用该领域搜索方法嵌入蚁群算法.采用国际著名的benchmark测试集FT06进行了实例验证,计算结果表明,该算法可收敛到最优值55,且最优值、平均值和标准差都优于蚁群算法,标准差远远小于蚁群算法.
The job shop problem by the SPT rules is researched. And the mathematical model with multi-restricted condition is set up. In order to solve ant colony algorithm convergence and plunging local optimal value, an improved ant colony algorithm which bases on interval number is developed. It uses local search to improve the result in every circle. And it is examined by means of the international famous benchmark sets FT06. The computation results show that this algorithm can get the optimal value 55. Optimal value, average value and standard deviation are better than ant colony algorithm. The standard deviation in improved ant colony algorithm is much smaller than the one in ant colony algorithm.
出处
《三峡大学学报（自然科学版）》
CAS
2009年第2期75-78,共4页
Journal of China Three Gorges University：Natural Sciences
关键词
车间作业调度
蚁群算法
邻域搜索
job shop problem
ant colony algorithm
local search
