针对传统遗传算法在求解作业车间调度问题时存在的算法收敛速度慢、寻优结果易陷入局部最优等缺点,提出了基于禁忌搜索算法的遗传交叉算子,利用禁忌表对交叉过程重复产生的子代进行有效禁忌,以加快算法的收敛速度,提高算法的全局搜索能力。算法设计了特殊的禁忌交叉方式,经实例表明:与传统的遗传算法相比,改进后的遗传算法在算法的收敛速度和求解的质量方面有了明显提高。
To the problem of slow convergence speed and optimization results easy to fall into local optimum when the traditional genetic algorithm is used to solve job shop scheduling problem ,a genetic crossover based on tabu search algorithm is proposed .In order to accelerate the convergence rate and improve the global search capability ,it taboos the offspring reproduced by the cross-process by use of tabu list .The algorithm designs a special way of taboo crossover .The example shows that :compared with the tra-ditional genetic algorithm ,the modified genetic algorithm can greatly improve the convergence speed and the solution quality .