Journal of Shanghai Jiaotong University ›› 2017, Vol. 51 ›› Issue (6): 704-708.

Previous Articles     Next Articles

 PerferredLearningBased Differential Evolution Algorithm

 LIU Hao,DING Jinliang,YANG Cui’e,CHAI Tianyou   

  1.  State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University,
     Shenyang  110819, China
  • Online:2017-06-30 Published:2017-06-30
  • Supported by:
     

Abstract:   Traditional differential evolution (DE) algorithm only abstracts information of random and the best individual. Randomness may result in a low searching efficiency, and even cannot find the best solution. A perferredlearningbased DE algorithm is proposed to solve this tough problem. The algorithm selectively uses the wellbehaved individual’s information and overcomes the blindness in the evolving process to enhance the searching ability. After different kind benchmark functions are investigated, the results reveal that the number of iterations can be clearly reduced and the calculation efficiency can be improved.

Key words:  differential evolution (DE) algorithm, perferred learning (PL), mutation strategy, function optimization

CLC Number: