摘要
作业车间调度是一类求解困难的组合优化问题,使用改进的遗传算法来求解。GA有新解产生盲目性的特点,以搜索效率为目标提出了一种改进的遗传算法,在解的搜索过程中,通过禁忌表操作来评价种群。改进的遗传算法在保持群体多样性的同时,加快了遗传算法的收敛速度,将该算法用于典型作业车间调度问题的测试,找到了已公布的最优解,对超大规模的问题还有待进一步研究。
Job Shop Scheduling is a difficult combinatorial optimization problem and an improved genetic algorithm is used to solve it. GA has a blind characteristic in generating new individuals. To improve searching efficiency, an improved genetic algorithm is proposed. In the searching process, the population is evaluated through taboo table. The new algorithm can speed up the convergence and meanwhile increase the diversity. The typical job shop scheduling problem is tested and satisfied results are found. As for large scale problem it still needs further research.
出处
《武汉理工大学学报（信息与管理工程版）》
CAS
2006年第2期40-43,共4页
Journal of Wuhan University of Technology：Information & Management Engineering
关键词
作业车间调度
遗传算法
禁忌表
job shop scheduling
genetic algorithm
taboo table
