View article

This paper proposes an effective memetic differential evolution (DE) algorithm, or DECLS, that utilizes a chaotic local search (CLS) with a ‘shrinking’ strategy. The CLS helps to improve the optimizing performance of the canonical DE by exploring a huge search space in the early run phase to avoid premature convergence, and exploiting a small region in the later run phase to refine the final solutions. Moreover, the parameter settings of the DECLS are controlled in an adaptive manner to further enhance the search ability. To evaluate the effectiveness and efficiency of the proposed DECLS algorithm, we compared it with four state-of-the-art DE variants and the IPOP-CMA-ES algorithm on a set of 20 selected benchmark functions. Results show that the DECLS is significantly better than, or at least comparable to, the other optimizers in terms of convergence performance and solution accuracy. Besides, the DECLS …