• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science

Previous Articles     Next Articles

A cooperative differential evolution
algorithm with elitist-population strategy

MA Yongjie,ZHU Lin,TIAN Fuze   

  1. (College of Physics and Electronic Engineering,Northwest Normal University,Lanzhou 730070,China)
  • Received:2017-04-21 Revised:2018-01-23 Online:2019-02-25 Published:2019-02-25

Abstract:

To solve the problems of premature convergence and easy falling into local optimum in the differential evolution algorithm when dealing with function optimization problems of population diversity, we propose a cooperative differential evolution algorithm with elitistpopulation strategy (ESCDE). In the population optimization process, we firstly evaluate population fitness,  extract the first several excellent individuals as the elite population and divide the others randomly into three sub-populations of the same size. Each subpopulation adopts a different evolution strategy to guarantee the diversity of the population and improve the performance of the algorithm. And then, the elite population and the remaining three subpopulations are updated according to the new fitness value to avoid falling into local optimum. Finally, comparison are made between the proposed algorithm and four other advanced differential evolution algorithms on 30 standard test functions in CEC2014. Experimental results indicate that the proposed algorithm can improve convergence speed effectively with higher convergence precision and better optimization performance.

 

 

Key words: differential evolution, function optimization, elitist-population, cooperative evolution, parameter adaptive