正交蚁群系统求解无等待流水线调度

Orthogonal ant colony system for no-wait flow-shop scheduling

针对无等待流水线车间调度问题(no-waitflow-shop scheduling problem,NWFSP)的特点,为了进一步提高求解质量,提出了新的启发函数的构造方法。为降低算法陷入局部最优状态的可能性,采取了控制启发值的上下限进行控制,达到了缩小启发值之间差异的目标。另外,受统计学中的正交试验设计方法的启发,使用正交表对蚁群算法的搜索结果进行正交测试。最后,通过引入多重插入移动机制进行搜索,提高了算法求解的质量。对标准测试数据进行测试,实验结果表明,该方法获得的解要优于标准测试数据中提供的已知解,证明正交测试对解有一定的改进效果。

To improve the qualities of the solutions of NWFSP（no-wait flow-shop scheduling problem）, a new heuristic function is proposed and heuristic values＇upper and lower bounds are limited to avoid falling into local optimal solutions.Besides, the algorithm is combined with the orthogonal experiment design method to improve the search result.Finally, a multiple insert move algorithm is imported in order to optimize the global optimal solution.Tests of benchmark with different scales are carried out and showed the improvement of the orthogonal ant colony system.