摘要
针对遗传算法和禁忌搜索算法在求解车间作业调度问题存在的全局收敛性差、种群早熟化、收敛速度慢等缺陷,提出了一种自适应遗传禁忌搜索算法。算法通过自适应调整遗传算子中的变异概率,改善了遗传算法的收敛速度;通过增加禁忌表来选择杂交产生的个体,避免迂回搜索,以禁忌搜索算法作为变异算子,增加种群的多样性,避免算法陷入局部最优。通过仿真实例,验证了算法的收敛性和抗局部收敛性。
To overcome the shortcoming of the genetic algorithm and the tabu search algorithm for solving the job shop scheduling problem,this paper proposes an adaptive genetic tabu algorithm. By adjusting the mutation probability adaptively and putting the tabu search algorithm to the process of the genetic algorithm,the improved genetic tabu algorithm promotes the rate in convergence and avoids such disadvantages as premature convergence. Simulation experiments demonstrate that the proposed improved genetic tabu algorithm is fast in convergence,and it does not get stuck at a local optimum easily.
出处
《计算机系统应用》
2010年第4期53-57,共5页
Computer Systems & Applications
基金
重庆市科委科技计划项目攻关项目(102074920080018)
关键词
遗传算法
禁忌搜索算法
车间作业调度
变异概率
genetic algorithm
tabu search algorithm
job shop scheduling
mutation probability
