首页 | 本学科首页   官方微博 | 高级检索  
     

遗传算法解决车间作业调度问题的优化研究
引用本文:杜宏伟,潘志国,林悦香,刘艳芬,姜学东.遗传算法解决车间作业调度问题的优化研究[J].组合机床与自动化加工技术,2007,4(5):109-112.
作者姓名:杜宏伟  潘志国  林悦香  刘艳芬  姜学东
作者单位:莱阳农学院,机电工程学院,青岛,266109
摘    要:遗传算法由于其隐合并行性和全局解空间搜索两大优点而成为解决JobShop问题的常用工具。但是由于JobShop问题本身的特点,普通遗传算法难以在解此类问题时获得满意解,最突出的问题就是过早收敛于某一局部最优解,使算法效率降低。文章从实用角度出发,通过优化种群、降低选择压力和将模拟退火算子加入到算法中对遗传算法进行了优化,以使其适应于JobShop问题的特殊情况,并以Matlah为工具讲行了仿真实验.获得了较好效果。

关 键 词:作业车间调度问题(JSP)  遗传算法(GA)  模拟退火算法(SA)  选择压力
文章编号:1001-2265(2007)05-0109-04
修稿时间:2006-10-24

Optimization of JSP-Oriented Genetic Algorithm
DU Hong-wei,PAN Zhi-guo,LIN Yue-xiang,LIU Yan-fen,JIANG Xue-dong.Optimization of JSP-Oriented Genetic Algorithm[J].Modular Machine Tool & Automatic Manufacturing Technique,2007,4(5):109-112.
Authors:DU Hong-wei  PAN Zhi-guo  LIN Yue-xiang  LIU Yan-fen  JIANG Xue-dong
Affiliation:Faculty of Electromechanical Engineering, Laiyang Agriculture College, Qingdao 266109, China
Abstract:Because of its implicit parallelism and global searching ability,Genetic Algorithm(GA) becomes the widely used Algorithm in resolving Job Shop Scheduling Problems(JSP).However,with JSP's specialty,the satisfying resolution can hardly receive from simple GA(SGA),of which the most obvious flaw is it always converges at a local extremum instead of the global one.This paper describes the optimization of GA,by way of improving the initialized population,reduce the selecting pressure and add SA operator into GA,to enable GA deal with JSP successfully.A Matlab example of using optimized GA is also proposed in the end of this paper.
Keywords:genetic algorithm  job shop scheduling problem(JSP)  local extremum
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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