期刊文献+

适用于高维优化问题的改进进化策略 被引量:18

Improved evolution strategies for high-dimensional optimization
下载PDF
导出
摘要 针对高维连续函数优化问题,研究了CES(classical evo lution strateg ies)的变异方式、繁殖方式,提出了全基因变异与单基因变异的概念,通过理论分析和仿真计算论证了单基因变异比全基因变异具有更好的局部搜索能力和少的计算开销;针对CES策略参数(变异幅度)随机性过强,不能很好地跟踪进化过程的问题,提出了随着进化过程递减的策略参数.最后,建立了单基因Gauss变异与均匀变异相结合、使用精英繁殖、递减型策略参数、小种群规模的(μ+λ+k)-ES,给出了一组100维典型测试函数的仿真计算结果. For high-dimensional continuous function optimization, manners of mutation and reproduction of classical evolution strategies (CES) are investigated. Concepts of all-gene mutation and single-gene mutation are proposed and it is proofed through theoretical analysis and simulation that single-gene mutation significantly outperforms all-gene mutation in both local searching capability and computation costs. Since parameters of CES cannot properly track the process of evolution because of their strong randomness, a strategy parameter is introduced which descends in the process of evolution. Finally, a new ES, called (μ+λ+k) -ES, is established which is characterized with single-gene Gaussian plus uniform mutation, elitist-reproduction, descending strategy parameter and small population size. Simulation results on a set of 100-dimensional typical test functions are presented.
出处 《控制理论与应用》 EI CAS CSCD 北大核心 2006年第1期148-151,共4页 Control Theory & Applications
基金 国家自然科学基金资助项目(50275150)
关键词 进化策略 变异 繁殖 策略参数 优化 evolution strategies mutation reproduction strategy parameter optimization
  • 相关文献

参考文献8

  • 1YAO Xin,LIU Yong.Fast evolution strategies [C]//Proc of the 4th IEEE Conf in Evolutionary Programming.ANGELINE P J,REYNOLDS R,MCDONN J,et al.Berlin,Germany:Springer-Verlag,1997:151-161.
  • 2KAPPLER C.Are evolutionary algorithms improved by large mutation [C]// Lecture Notes in Computer Science:Parallel Problem Solving from Nature (PPSN) Ⅳ.VOIGT H M,EBELING W,ROCHENBERG I,et al.Berlin,Germany:Springer-Verlag,1996,1141:346-355.
  • 3林丹,李敏强,寇纪凇.进化规划和进化策略中变异算子的若干研究[J].天津大学学报(自然科学与工程技术版),2000,33(5):627-630. 被引量:24
  • 4GUNTER R.Local convergence rates of simple evolutionary algorithms with Cauchy mutations [J].IEEE Trans on Evolutionary Computation,1997,4(1):249-258.
  • 5CHANG Ming,KAZUHIRO O,KANJI U.Some experimental observations of (μ,μ,λ)-evolution strategies [C]// Proceedings of the 2001 Congress on Evolutionary Computation.Seoul:COEX Center,2001,1:663-670.
  • 6BACK T,SCHWEFEL H P.Evolution Computation:An Overview [C]//Proc 3rd IEEE Conf on Evolution Computation 1996.Piscataway,NU:IEEE Press,1996:20-29.
  • 7彭宏,杨立洪,郑咸义,雷秀仁.计算工程优化问题的进化策略[J].华南理工大学学报(自然科学版),1997,25(12):17-21. 被引量:13
  • 8LEUNG Yiuwing,WANG Yuping.An orthogonal genetic algorithm with quanitization for global numerical optimization [J].IEEE Trans on Evolutionary Computation,2001,1 (5):41-53.

二级参考文献7

  • 1 Baeck T.Evolutionary algorithms intheory and practice[M].Pi scataway,NJ:IEEE Press,1995.
  • 2 Yao X,Liu Y.Fast evolutionary programming[A].L.J.Fogel,ed. Proceedings ofthe Fifth Annual Conference on Evoltionary Programming[C].Cam bridge:MITPress,1996,441~450.
  • 3 Yao X,Liu Y.Fast evolutionary strategies[A].P.J.Angeline,e d.Proceedingsof the Sixth Annual Conference on Evolutionary Programming[C].Berlin:Springer,1997,151~161.
  • 4 Gehlhaar D K,F ogel D B.Two new mutation operators for enhanced search andoptimization in evol utionary programming[A].B.Biosacchi,J.Bezdek andD.B.Fogel,eds.Proceedings o f SPIE[C].Piscataway,NJ:IEEE Press,1996,3165:260~269.
  • 5 Beyer G H,Fogel D B.A note on the escape probabilities for two a lternativemethods of selection under gaussian mutation[A].P.J.Angeline,ed.P roceedings of theSixth Annual Conference on Evolutionary Programming[C].Ber lin:Springer,1997,265~274.
  • 6 Eicker F.Sums if independent squard Cauchy variables grow quadratically:Applications[J].Sankhya A,1985,47(3f):678~691.
  • 7 Feller W.An introduction to probability theory and its Applic ations,vol.2[M].NewYork:John Wiley & Sons Inc,1971.

共引文献34

同被引文献145

引证文献18

二级引证文献85

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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