Journal of Northeastern University ›› 2011, Vol. 32 ›› Issue (6): 777-780.DOI: -

• OriginalPaper • Previous Articles     Next Articles

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:
    -

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.

CLC Number: