期刊文献+

多种群差分进化算法及在柔性车间作业调度中的应用 被引量:2

A multi-population differential evolution algorithm and its application in flexible job shop scheduling
下载PDF
导出
摘要 针对柔性车间作业调度问题,在深入分析差分进化算法的基础上,提出了一种多种群差分进化算法.该算法基于DE/rand/2/bin变异方式全局搜索能力强,鲁棒性好,和DE/best/2/bin变异方式局部搜索能力强,收敛速度快;包含若干个普通种群和一个精英种群,普通种群采用DE/rand/2/bin变异方式,精英种群采用DE/best/2/bin变异方式,普通种群和精英种群及普通种群之间在适当的时候进行优秀个体迁移,以实现全局搜索能力和收敛速度之间的平衡,并从现实生产实际出发,建立了双目标柔性车间作业调度数学模型.最后,将该算法应用于一个调度算例,仿真结果表明,该算法可行有效. In view of the problem in flexible job shop scheduling problem, a multi-population differential evolution algorithm was presented, based on the thorough analysis of differential evolution (DE) algorithm. Based on the high global searching ability and robustness of DE/rand/2/bin mutation scheme and the good performance of local searching ability and fast convergence speed of DE/best/2/bin mutation scheme, the algorithm includes several ordinary populations and a particular population. The ordinary populations take the DE/rand/2/bin mutation scheme, while the particular population takes the DE/best/2/bin mutation scheme. To balance the global searching ability and the convergence speed, some excellent individuals are migrated in proper time between ordinary populations and particular population and ordinary populations themselves. And a bi-objective mathematical model of flexible job shop scheduling is established for the sake of practical production. Finally, the algorithm is used in an example of scheduling, the simulation results show that the algorithm is feasible and efficient.
作者 谈峰 王伟
出处 《湖南农业大学学报(自然科学版)》 CAS CSCD 北大核心 2008年第1期105-108,共4页 Journal of Hunan Agricultural University(Natural Sciences)
基金 国家自然科学基金(60371046)
关键词 柔性车间作业调度 多种群 差分进化算法 双目标数学模型 flexible job shop scheduling multi-population DE algorithm bi-objective mathematical model
  • 相关文献

参考文献7

二级参考文献140

共引文献365

同被引文献20

  • 1冯琦,周德云.基于微分进化算法的时间最优路径规划[J].计算机工程与应用,2005,41(12):74-75. 被引量:31
  • 2尹新,杨自厚.用Tabu Search方法解带有等待时间惩罚的提前/拖期调度问题[J].系统工程理论方法应用,1995,4(1):30-35. 被引量:3
  • 3李建祥,唐立新,吴会江.带运输和设置时间的无等待并行流水车间调度问题研究[J].系统工程理论与实践,2006,26(1):18-25. 被引量:13
  • 4Lin B,Wang L,Jin Y H.An effective hybrid particlesw arm optimization for no-w ait flow shop scheduling[J].Int.J Adv.Manuf.Technol,2007,31:1001-1011.
  • 5Xu X Y,Ye N.Minimization of job waiting time va-riance on identical parallel machines[J].IEEETrazns on Systems,Man,and Cybernetics-Part C:Applications and Review s,2007,37(5):917-927.
  • 6Su L H.A hybrid two-stage flowshop with limitedw aiting time constraints[J].Computers&IndustrialEngineering,2003,44:409-424.
  • 7Li X P,Ye N,Liu T M,et al.Job scheduling to mini-mize the w eighted w aiting time variance of jobs[J].Computers&Industrial Engineering,2007,52:41-56.
  • 8Tasgetiren M F,Liang Y C,Sevkli M,et al.A parti-cle sw arm optimization algorithm for makespan andtotal flow time minimization in the permutation flow-shop sequencing problem[J].European Journal ofOperational Research,2007,177(3):1930-1947.
  • 9Storn R,Price K.Differential evolution-a simple andefficient heuristic strategy for global optimization o-ver continuous spaces[J].Journal of Global Optimi-zation,1997,11:341-359.
  • 10Han Z,Shi H,Liu C.Differential evolution algorithmfor the earliness tardiness hybrid flow-shop schedu-ling problem[C] //The 3rd International Conferenceon Intelligent Information Technology Application,Nanchang,China,USA:IEEE Computer Science,2009:188-193.

引证文献2

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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