Adaptive strategy selection in differential evolution for numerical optimization: An empirical study

  • Authors:

  • Wenyin Gong;Álvaro Fialho;Zhihua Cai;Hui Li

  • Affiliations:

  • School of Computer Science, China University of Geosciences, Wuhan 430074, PR China and State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, PR China;Nokia Institute of Technology, 69048-660 Manaus, AM, Brazil;School of Computer Science, China University of Geosciences, Wuhan 430074, PR China;School of Computer Science, China University of Geosciences, Wuhan 430074, PR China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2011

Quantified Score

Hi-index 0.07

Visualization

Abstract

Differential evolution (DE) is a versatile and efficient evolutionary algorithm for global numerical optimization, which has been widely used in different application fields. However, different strategies have been proposed for the generation of new solutions, and the selection of which of them should be applied is critical for the DE performance, besides being problem-dependent. In this paper, we present two DE variants with adaptive strategy selection: two different techniques, namely Probability Matching and Adaptive Pursuit, are employed in DE to autonomously select the most suitable strategy while solving the problem, according to their recent impact on the optimization process. For the measurement of this impact, four credit assignment methods are assessed, which update the known performance of each strategy in different ways, based on the relative fitness improvement achieved by its recent applications. The performance of the analyzed approaches is evaluated on 22 benchmark functions. Experimental results confirm that they are able to adaptively choose the most suitable strategy for a specific problem in an efficient way. Compared with other state-of-the-art DE variants, better results are obtained on most of the functions in terms of quality of the final solutions and convergence speed.