期刊文献+

基于简化群优化算法和协方差矩阵学习的差分进化算法

A new differential evolution algorithm based on SSO algorithm and covariance matrix learning
下载PDF
导出
摘要 把SSO算法的交叉策略、协方差矩阵学习策略与传统的DE算法结合,提出一个新的DE算法的变种,我们把它称作SCDE算法。正如我们所知,DE算法的变异策略在DE算法中占据了非常重要的位置,然而,传统的DE算法的变异策略都是用相对位置来产生候选解,本文尝试利用个体历史最优解来诱导变异产生候选解,这将大大提高种群跳出局部最优的能力。此外,将算法的变异和交叉操作放在由种群的协方差矩阵的所有特征向量组成的坐标系中执行,这将使算法的交叉和变异操作具有旋转不变性。实验结果表明,本文提出的新的交叉和变异策略可以大大提高DE算法在CEC 2013中28个测试函数的全局寻优能力。 We propose a new differential evolution (DE) algorithm which incorporates the DE with the crossover thought of the simplified swarm optimization (SSO) algorithm and the covariance matrix learning, called SCDE algorithm. As we know, mutation operation plays a very important role in the performance of the DE. However, traditional mutation strategies of the DE all use the relative position to generate a candidate vector. We try to utilize individual historical optimal solution to induce the variation, which can greatly enhance its ability of jumping out of local populations. Furthermore, the crossover and mutation operations are executed in an appropriate coordinate system which is generated by the covariance matrix of the population and it can make the crossover and mutation operation rotationally invariant. Experimental results show that the proposed algorithm can significantly improve the DE's performance on a set of 28 test functions in CEC 2013 benchmark sets.
出处 《计算机工程与科学》 CSCD 北大核心 2017年第11期2122-2130,共9页 Computer Engineering & Science
基金 安徽省高校省级重点自然科学研究项目(KJ2013A009)
关键词 差分进化算法 绝对位置 协方差矩阵 旋转不变性 differential evolution algorithm absolute position covariance matrix rotationally invariant
  • 相关文献

参考文献1

二级参考文献11

  • 1Shu F T.Economic Ordering Frequency for Two Items Jointly Replenisher[J].Management Science,1971,17(6):B406-B410.
  • 2Andreas N,Anders S,Erik V.A New Iterative Heuristic to Solve the Joint Replenishment Problem Using a Spreadsheet Technique[J].International Journal of Production Econom-ics,2007,108(1-2):399-405.
  • 3Olsen A L.An Evolutionary Algorithm to Solve the Joint Replenishment Problem Using Direct Grouping[J].Comput-ers&Industrial Engineering,2005,48(2):223-235.
  • 4Moon I K,Cha B C.The Joint Replenishment Problem with Resource Restriction[J].European Journal of Operational Research,2006,173(1):190-198.
  • 5Hoque M A.An Optimal Solution Technique for the Joint Replenishment Problem with Storage and Transport Capaci-ties and Budget Constraints[J].European Journal of Opera-tional Research,2006,175(2):1033-1042.
  • 6Arkin E,Joneja D,Round Y R.Computational Complexity of Uncapacitated Multi-echelon Production Planning Prob-lems[J].Operations Research Letters,1989,8(2):61-66.
  • 7Wang Y C,Cheng W T.A Sensitivity Analysis of Solving Joint Replenishment Problems Using the RAND Method Un-der Inaccurate Holding Cost Estimates and Demand Forecasts[J].Computes&Industrial Engineering,2008,8(1):243-252.
  • 8Khouja M,Goyal S.A Review of the Joint Replenishment Problem Literature:1989-2005[J].European Journal of Operational Research,2008,186(1):1-16.
  • 9Zhang M,Luo W J,Wang X F.Differential Evolution with Dynamic Stochastic Selection for Constrained Optimization[J].Information Sciences,2008,178(15):3043-3074.
  • 10李成严,徐晓飞,战德臣.模糊资源约束的联合补充问题[J].计算机集成制造系统,2008,14(1):113-117. 被引量:14

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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