Multiscale Cooperative Differential Evolution Algorithm

16Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A multiscale cooperative differential evolution algorithm is proposed to solve the problems of narrow search range at the early stage and slow convergence at the later stage in the performance of the traditional differential evolution algorithms. Firstly, the population structure of multipopulation mechanism is adopted so that each subpopulation is combined with a corresponding mutation strategy to ensure the individual diversity during evolution. Then, the covariance learning among populations is developed to establish a suitable rotating coordinate system for cross operation. Meanwhile, an adaptive parameter adjustment strategy is introduced to balance the population survey and convergence. Finally, the proposed algorithm is tested on the CEC 2005 benchmark function and compared with other state-of-the-art evolutionary algorithms. The experiment results showed that the proposed algorithm has better performance in solving global optimization problems than other compared algorithms.

Cite

CITATION STYLE

APA

Du, Y., Fan, Y., Liu, X., Luo, Y., Tang, J., & Liu, P. (2019). Multiscale Cooperative Differential Evolution Algorithm. Computational Intelligence and Neuroscience, 2019. https://doi.org/10.1155/2019/5259129

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free