基于改进遗传算法的多目标JSP调度研究.pdfVIP

( ) 　　中图分类号 :TP301 　　文献标识码 :A 　　文章编号 :1009 - 2552 2009 05 - 0203 - 03 基于改进遗传算法的多目标J SP 调度研究 曹成辉 , 王 　坚 (东华大学信息科学与技术学院 , 上海 201620) ( ) 摘 　要 : 针对多目标车间作业调度问题 J SP , 提出了一种混合遗传算法 , 将多目标遗传算法得 出的初步优化结果作为粒子群算法的初始粒子 , 利用粒子群算法强化局部搜索 , 加快收敛速度 , 改善了简单遗传算法局部搜索能力差 、迭代效率低的问题 。仿真结果表明了该算法对J SP 调度的 良好效果 。 关键词 : 多目标优化 ; J SP 调度 ; 粒子群算法 ; 遗传算法 Research on multiobject jobshop scheduling problem based on the improved genetic algorithm CAO Chenghui , WAN GJian ( College of Information Science and Technology ,Donghua University , Shanghai 201620 ,China) Abstract : In this paper , an improved genetic algorithm is proposed to solve the mutliobj ective jobshop scheduling problem (J SP) . This hybrid genetic algorithm approach is a method of combining the traditional genetic algorithm with the particle swarm optimization ( SPO) , in which multiobj ective genetic algorithm is adopted to get primary optimized results , treated as initial particles of the SPO . It is then applied to the enhancing of local searching and speed convergence , to solve traditional genetic algorithm ’s problems of poor local exploration capability and low efficiency of iteration . The simulation results show that this method approach is effectively applied to solve the mutliobj ective J SP. Key words : multiobj ective optimization ; jobshop scheduling problem ; particle swarm optimization ; genetic algorithm 0 　引言 的缺点 。PSOGA 在求解效率上优于遗传算法