东北大学学报(自然科学版) ›› 2011, Vol. 32 ›› Issue (6): 777-780.DOI: -

• 论著 • 上一篇    下一篇

动态环境下基于可变记忆的进化算法

关守平;尹晓峰;   

  1. 东北大学信息科学与工程学院;
  • 收稿日期:2013-06-19 修回日期:2013-06-19 发布日期:2013-04-04
  • 通讯作者: -
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60974070)

The variable size memory-based evolutionary algorithm in dynamic environments

Guan, Shou-Ping (1); Yin, Xiao-Feng (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Guan, S.-P.
  • About author:-
  • Supported by:
    -

摘要: 常规基于记忆的进化算法在动态环境中往往达不到期望的效果,这主要是由于记忆体大小的限制.为此提出了动态环境下基于可变记忆的进化算法(IMEEA),其核心思想是算法中拥有两个种群,即搜索种群和记忆种群,同时采用过度变异策略来增加种群的多样性.算法中的两个种群有最小和最大的允许长度,并且种群的大小根据进化过程的进行而不断变化.仿真结果表明,在动态环境中IMEEA算法的跟踪误差要小于常规的记忆提高进化算法(MEEA),从而证明了所提算法的有效性.

关键词: 动态优化, 进化算法, 记忆, 多样性

Abstract: Traditional memory-based evolutionary algorithms often may not achieve the desired performances in dynamic environments, which is mainly due to the fixed memory size. A variable size memory-based evolutionary algorithm is proposed. The improved memory enhanced evolutionary algorithm (IMEEA), which combines memory population and search population, and hyper-mutation is used to promote and maintain diversity. The two populations have minimum and maximum sizes allowed that change according to the stage of the evolutionary process. Simulation results show that the tracking error of the IMEEA is less than the memory enhanced evolutionary algorithm (MEEA), and then prove the effectiveness of this new algorithm.

中图分类号: