Differential evolution using interpolated local search

Abstract

In this paper we propose a novel variant of the Differential Evolution (DE) algorithm based on local search. The corresponding algorithm is named as Differential Evolution with Interpolated Local Search (DEILS). In DEILS, the local search operation is applied in an adaptive manner. The adaptive behavior enables the algorithm to search its neighborhood in an effective manner and the interpolation helps in exploiting the solutions. In this way a balance is maintained between the exploration and exploitation factors. The performance of DEILS is investigated and compared with basic differential evolution, modified versions of DE and some other evolutionary algorithms. It is found that the proposed scheme improves the performance of DE in terms of quality of solution without compromising with the convergence rate. © 2010 Springer-Verlag Berlin Heidelberg.