论文部分内容阅读
为了最小化置换流水车间调度问题的完工时间,提出了一种基于混合离散人工蜂群(Hybrid Discrete Artificial Bee Colony)算法的置换流水车间调度算法。首先,根据NEH启发式算法,由贪心随机自适应搜索算法(GRASP)产生蜂群的质量和多样性。然后利用诸如插入、交换、路径重连、GRASP之类的离散算子及算法来为采蜜蜂、观察蜂、侦测蜂寻求解决方案。最后,为了提高该算法的性能,在局部搜索算法融合混合策略。最后进行了对比实验,实验数据表明,该算法较于其他启发式方法,解的平均百分比误差整体要小,同等条件下调度的总完工时间要缩短7倍。
In order to minimize the completion time of the replacement flow shop scheduling problem, a replacement flow shop scheduling algorithm based on Hybrid Discrete Artificial Bee Colony algorithm is proposed. First of all, according to the NEH heuristic algorithm, greedy random adaptive search algorithm (GRASP) results in the quality and diversity of bee colony. We then use discrete operators and algorithms such as insert, swap, path reconnection, and GRASP to find solutions for mining bees, observing bees, and detecting bees. Finally, in order to improve the performance of the algorithm, the local search algorithm fuses the hybrid strategy. Finally, a comparison experiment is carried out. The experimental data show that compared with other heuristic methods, the average percentage error of the algorithm is smaller and the total completion time of scheduling under the same conditions is shortened by 7 times.