DE/EDA: a new evolutionary algorithm for global optimization

  • Authors:

  • Jianyong Sun;Qingfu Zhang;Edward P. K. Tsang

  • Affiliations:

  • Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, UK;Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, UK;Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, UK

  • Venue:
  • Information Sciences—Informatics and Computer Science: An International Journal
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Differential evolution (DE) was very successful in solving the global continuous optimization problem. It mainly uses the distance and direction information from the current population to guide its further search. Estimation of distribution algorithm (EDA) samples new solutions from a probability model which characterizes the distribution of promising solutions. This paper proposes a combination of DE and EDA (DE/EDA) for the global continuous optimization problem. DE/EDA combines global information extracted by EDA with differential information obtained by DE to create promising solutions. DE/EDA has been compared with the best version of the DE algorithm and an EDA on several commonly utilized test problems. Experimental results demonstrate that DE/EDA outperforms the DE algorithm and the EDA. The effect of the parameters of DE/EDA to its performance is investigated experimentally.