期刊文献+

基于动态群体的聚集演化求解多峰函数优化问题 被引量:2

Novel Dynamic-Population Based on Evolutionary Algorithm for Multimodal Function Optimization
下载PDF
导出
摘要 指出了现有的演化算法框架都是群体固定的演化迭代过程 ,对求解多峰函数优化问题时由于无法事先得知峰值点的个数而很难确定合适的群体大小 ,影响了算法的效率 .提出了一种群体动态可调的演化方式 ,使得初始群体大小可任意指定 ,在演化过程中通过聚集和按比例引入新个体两个过程而动态变化 .实验表明 ,该算法能尽可能多地定位峰值点 . The traditional evolutionary algorithm with a fixed size population is not suitable especially for solving multimodal function optimization because it's impossible to know the number of solution in advance and hence it's difficult to specify a suitable size of population. In this paper, a novel algorithm with dynamic population is presented. In the process of evolution, the size of population is tuned by a aggregation and introduction of new individuals. An initial experiment is given.
作者 覃俊 康立山
出处 《中南民族大学学报(自然科学版)》 CAS 2003年第2期56-59,共4页 Journal of South-Central University for Nationalities:Natural Science Edition
基金 国家自然科学基金资助项目 (6 96 35 0 30 6 0 0 730 4 3 70 0 71 0 4 2 )
关键词 动态群体 演化算法 多峰函数 优化问题 dynamic population evolutionary algorithm multimodal function
  • 相关文献

参考文献4

  • 1Castro L,Zuben L. Learning and optimization using the clonal selection principle evolutionary computation[J] . IEEE Tran , 2002,6(3):34-50.
  • 2Blalzs E, LI Jianping. The effect of distance measure in a GA with species conservation[C]. Proceedings of 2001 IEEE Congress on Evolutionary Computation.New York: Association for Evolutionary Computation, 2001. 67-74.
  • 3Deb K. Multi-objective optimization using evolutionary algorithms[M]. New York: John Wiley Sons Ltd, 2001. 246-394.
  • 4Wu Zhijian, Kang Lishan, Zou Xiufen. A parallel global-local mixed evolutionary algorithm for multimodal function optimization[C]. Proceedings of fifth international conference on algorithms and architectures for parallel processing. Beijing: Association for Parallel Processing, 2002. 247-250.

同被引文献12

  • 1刘洪杰,王秀峰.多峰搜索的自适应遗传算法[J].控制理论与应用,2004,21(2):302-304. 被引量:23
  • 2曾建潮,崔志华.一种保证全局收敛的PSO算法[J].计算机研究与发展,2004,41(8):1333-1338. 被引量:158
  • 3Mendes R,Kenedy J.The full informed particle swarm:simpler, maybe better[J].IEEE Transaction on Evolutionary Computation, 2004,8( 3 ) : 204-210.
  • 4Arabas J,Michalewicz Z,Mulawka J.GAVaPS-a genetic algorithms with varying population size[C]//Proc of the 1st IEEE ICEC'94. Orlando,Florida,USA:IEEE Press, 1994,1:73-78.
  • 5Back T,Eiben A E,van der Vaart.An empirical study on GAs "without parameters"[C]//Schoenauer M.LNCS 1917 : PPSN VI, 2000 : 315 -324.
  • 6Harik G R,Cantu-Paz E,Goldberg D E,et al.The gambler's ruin problem,genetic algorithms,and the sizing of population [C]// Proceedings of ICEC'97,1997:7-12.
  • 7Fernandes C,Ramos V,Rosa A C.Varying the population size of artificial foraging swarms on time varying landscapes [C]//LNCS 3696 : Proc ICANN'05,15th Int Conf.Warsaw, Poland : Springererlag, 2005:311-316.
  • 8Fernandes C,Rosa A.Self-regulated population size in evolutionary algorithms[C]//Proc 9th International Conference on PPSN 2006, Reykjavic, Iceland, 2006:921-929.
  • 9KENNEDY J, EBERHART R. Particle Swarm Optimization[A].IEEE International Conference on Neural Networks[C]. Perth, Australia, 1995.1942-1948.
  • 10SHI Y, EBERHART R. A modified particle swarm optimizer[A]. IEEE World Congress on Computational Intelligence[C], 1998.69-73.

引证文献2

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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