Self-adaptive differential evolution incorporating a heuristic mixing of operators

  • Authors:

  • Saber M. Elsayed;Ruhul A. Sarker;Daryl L. Essam

  • Affiliations:

  • School of Engineering and Information Technology, University of New South Wales, Canberra, Australia 2600;School of Engineering and Information Technology, University of New South Wales, Canberra, Australia 2600;School of Engineering and Information Technology, University of New South Wales, Canberra, Australia 2600

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

A considerable number of differential evolution variants have been proposed in the last few decades. However, no variant was able to consistently perform over a wide range of test problems. In this paper, propose two novel differential evolution based algorithms are proposed for solving constrained optimization problems. Both algorithms utilize the strengths of multiple mutation and crossover operators. The appropriate mix of the mutation and crossover operators, for any given problem, is determined through an adaptive learning process. In addition, to further accelerate the convergence of the algorithm, a local search technique is applied to a few selected individuals in each generation. The resulting algorithms are named as Self-Adaptive Differential Evolution Incorporating a Heuristic Mixing of Operators. The algorithms have been tested by solving 60 constrained optimization test instances. The results showed that the proposed algorithms have a competitive, if not better, performance in comparison to the-state-of-the-art algorithms.