Ranking-based hierarchical random mutation in differential evolution

3Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

In order to improve the performance of differential evolution (DE), this paper proposes a ranking-based hierarchical random mutation in differential evolution (abbreviated as RHRMDE), in which two improvements are presented. First, RHRMDE introduces a hierarchical random mutation mechanism to apply the classic "DE/rand/1"and its variant on the non-inferior and inferior group determined by the fitness value. The non-inferior group employs the traditional mutation operator "DE/rand/1"with global and random characteristics, which increases the global exploration ability and population diversity. The inferior group uses the improved mutation operator "DE/rand/1"with elite and random characteristics, which enhances the local exploitation ability and convergence speed. Second, the control parameter adaptation of RHRMDE not only considers the complexity differences of various problems but also takes individual differences into account. The proposed RHRMDE is compared with five DE variants and five non-DE algorithms on 32 universal benchmark functions, and the results show that the RHRMDE is superior over the compared algorithms. Copyright:

Cite

CITATION STYLE

APA

Zhong, X., Duan, M., & Cheng, P. (2021). Ranking-based hierarchical random mutation in differential evolution. PLoS ONE, 16(2 February). https://doi.org/10.1371/journal.pone.0245887

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