期刊文献+

基于并行融合机制的改进遗传算法求解HFSP调度问题 被引量:4

AN IMPROVED GENETIC ALGORITHM FOR HFSP SCHEDULING PROBLEM BASED ON PARALLEL FUSION MECHANISM
下载PDF
导出
摘要 针对混合流水车间调度问题(Hybrid Flow Shop Scheduling Problem,HFSP),以总工位切换时间为目标函数建立仿真优化模型,并提出一种基于种群并行融合机制的改进遗传算法(PIGA)进行求解。通过仿真模型计算目标函数适应度值并在遗传算法的迭代进化中引入并行融合拆分机制;在传统遗传算法的基础上将精英保留策略引入个体选择机制,将自适应遗传因子引入交叉变异概率,建立改进自适应遗传算法;运用该算法进行仿真优化实验,实验结果证明了该算法的有效性。 For the hybrid flow shop scheduling problem(HFSP),this paper establishes a simulation optimization model with the total station switching time as the objective function,and proposes an improved genetic algorithm(PIGA)based on the population parallel fusion mechanism.The fitness value of objective function was calculated through simulation model,and the parallel fusion and resolution mechanism was introduced in the iterative evolution of genetic algorithm.Based on the traditional genetic algorithm,we introduced elite retention strategy into individual selection mechanism,and introduced adaptive genetic factors into crossover mutation probability,so as to establish an improved adaptive genetic algorithm.The simulation optimization experiment was carried out by the algorithm.The experimental result proves the effectiveness of the algorithm.
作者 张源 陶翼飞 王加冕 Zhang Yuan;Tao Yifei;Wang Jiamian(Faculty of Mechanical and Electrical Engineering,Kunming University of Science and Technology,Kunming 650500,Yunnan,China)
出处 《计算机应用与软件》 北大核心 2022年第6期252-257,共6页 Computer Applications and Software
基金 国家自然科学基金项目(51165014)。
关键词 混合流水车间 自适应遗传算法 总工位切换时间 并行融合拆分机制 精英保留策略 Hybrid flow shop Adaptive genetic algorithm Total station switching time Parallel fusion split mechanism Elite retention strategy
  • 相关文献

参考文献10

二级参考文献82

  • 1张超勇,饶运清,刘向军,李培根.基于POX交叉的遗传算法求解Job-Shop调度问题[J].中国机械工程,2004,15(23):2149-2153. 被引量:110
  • 2崔建双,李铁克,张文新.混合流水车间调度模型及其遗传算法[J].北京科技大学学报,2005,27(5):623-626. 被引量:29
  • 3高亮,高海兵,周驰.基于粒子群优化的开放式车间调度[J].机械工程学报,2006,42(2):129-134. 被引量:16
  • 4张超勇,饶运清,李培根,邵新宇.柔性作业车间调度问题的两级遗传算法[J].机械工程学报,2007,43(4):119-124. 被引量:105
  • 5Laarhoven P J M V,Aarts E H L,Lenstra J K. Job shop scheduling by simulated annealing[ J]. Operations Research, 1992,40 : 113 - 125.
  • 6Taillard E D. Parallel taboo search techniques for the job shop scheduling problem [ J]. ORSA Journal on Computing, 1994,6 ( 2 ) : 108 -117.
  • 7Davis L. Job shop scheduling with genetic algorithms [ C ]//Proceedings of the First International Conference on Genetic Algorithms and their Applications. Morgan Kaufmann, 1985 : 136 - 140.
  • 8Adams J,Balas E,Zawack D. The shifting bottleneck procedure for job shop scheduling [ J ]. Management Science, 1988,34:391 - 401.
  • 9Cai L W,WU QH ,Yong Z Z. A genelic algorithm with local search for solving job shop problems. Lecture Notes in Computer Science, 2000: 107 - 116.
  • 10Chaoyong Zhang ,Yunqing Rao,Peigen I,i. An effective hybrid genetic algorithm for the "job shop scheduling problem [ J ]. The International Journal of Advanced Manufacturing Technology,2008:965- 974.

共引文献140

同被引文献46

引证文献4

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部