首页 | 官方网站   微博 | 高级检索  
     

基于遗传和禁忌搜索算法求解车间调度优化问题
引用本文:梁迪,谢里阳,隋天中,陶泽.基于遗传和禁忌搜索算法求解车间调度优化问题[J].计算机应用,2006,26(4):857-860.
作者姓名:梁迪  谢里阳  隋天中  陶泽
作者单位:1. 东北大学,机械工程与自动化学院,辽宁,沈阳,110004;沈阳大学,机械工程学院,辽宁,沈阳,110004
2. 东北大学,机械工程与自动化学院,辽宁,沈阳,110004
摘    要:针对柔性生产环境下的车间调度问题,在考虑遗传算法早熟收敛问题和禁忌搜索法自适应优点的基础上,将遗传算法和禁忌搜索法结合起来,提出了基于遗传和禁忌搜索的混合动态优化调度算法,并用实例对该算法进行了仿真研究。结果表明,此算法有很好收敛精度,是可行的,并且能够在扰动发生后提供新的调度计划,与传统的调度算法相比较,体现了明显的优越性。

关 键 词:遗传算法  禁忌搜索算法  车间调度  组合优化
文章编号:1001-9081(2006)04-0857-04
收稿时间:2005-10-12
修稿时间:2005-10-122005-12-26

Research on shop scheduling optimization based on genetic and tabu search hybrid algorithm
LIANG Di,XIE Li-yang,SUI Tian-zhong,TAO Ze.Research on shop scheduling optimization based on genetic and tabu search hybrid algorithm[J].journal of Computer Applications,2006,26(4):857-860.
Authors:LIANG Di  XIE Li-yang  SUI Tian-zhong  TAO Ze
Affiliation:1. School of Mechanical Engineering and Automation, Northeastern University, Shenyang Liaoning 110004, China; 2. School of Mechanical Engineering, Shenyang University, Shenyang Liaoning 110044, China
Abstract:In order to avoid premature convergence and to balance the exploration and exploitation abilities of simple GA,a hybrid algorithm was proposed to solve dynamic scheduling problem in flexible production environment. It is using GA excellent whole search ability and self-adaptive merit of Tabu Search(TS), and the convergence of research was improved. It is capable of generating alternative schedule after uncertain disturbance takes place on a job shop. After using crossover and mutation operations, a best or second best scheduling plan can be found. The result of the test shows that the method is feasible and efficient.
Keywords:genetic algorithm  tabu search  job shop scheduling  combination optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号