基于HDABC算法的置换流水车间调度策略  

Permutation Flow Shop Scheduling Based on Hybrid Discrete Artificial Bee Colony Algorithm

作　　者：刘刚[1] 黄崇争[2] 

机构地区：[1]南宁职业技术学院现代教育技术中心,南宁530008 [2]广西建设职业技术学院信息中心,南宁530008

出　　处：《控制工程》2017年第9期1925-1929,共5页Control Engineering of China

基　　金：广西高校科学技术研究项目(KY2015YB396);科技部科技型中小企业技术创新基金项目(12C26214505663)

摘　　要：为了最小化置换流水车间调度问题的完工时间,提出了一种基于混合离散人工蜂群(Hybrid Discrete Artificial Bee Colony)算法的置换流水车间调度算法。首先,根据NEH启发式算法,由贪心随机自适应搜索算法(GRASP)产生蜂群的质量和多样性。然后利用诸如插入、交换、路径重连、GRASP之类的离散算子及算法来为采蜜蜂、观察蜂、侦测蜂寻求解决方案。最后,为了提高该算法的性能,在局部搜索算法融合混合策略。最后进行了对比实验,实验数据表明,该算法较于其他启发式方法,解的平均百分比误差整体要小,同等条件下调度的总完工时间要缩短7倍。To minimize the completion time in permutation flow shop scheduling problems, a hybrid discrete artificial bee colony algorithm optimized by NEH heuristics is proposed. Firstly, the initial population with certain quality and diversity is generated by greedy randomized adaptive search procedure （GRASP） using NEH heuristics. Then, the discrete operators and algorithm, such as insert, swap, path reconnection and GRASP are applied to generate new solution for the employed bees, onlookers and scouts. Finally, local search is applied to improve the performance of the proposed algorithm. The effectiveness of the proposed method is verified by simulation results. Experimental results show that the proposed algorithm has improved the solution quality and reduced the total completion time of scheduling compared with several frequently-used heuristic methods, the average percentage error of the solution is smaller, and the total completion time is 7 times shorter under the same conditions.

关 键 词：置换流水车间调度 混合离散 人工蜂群算法 启发式算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]