Memetic Differential Evolution with an Improved Contraction Criterion

Abstract EN

Memetic algorithms with an appropriate trade-off between the exploration and exploitation can obtain very good results in continuous optimization.

In this paper, we present an improved memetic differential evolution algorithm for solving global optimization problems.

The proposed approach, called memetic DE (MDE), hybridizes differential evolution (DE) with a local search (LS) operator and periodic reinitialization to balance the exploration and exploitation.

A new contraction criterion, which is based on the improved maximum distance in objective space, is proposed to decide when the local search starts.

The proposed algorithm is compared with six well-known evolutionary algorithms on twenty-one benchmark functions, and the experimental results are analyzed with two kinds of nonparametric statistical tests.

Moreover, sensitivity analyses for parameters in MDE are also made.

Experimental results have demonstrated the competitive performance of the proposed method with respect to the six compared algorithms.