z-logo
open-access-imgOpen Access
Ranking-based hierarchical random mutation in differential evolution
Author(s) -
Xuxu Zhong,
Meijun Duan,
Peng Cheng
Publication year - 2021
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0245887
Subject(s) - mutation , differential evolution , benchmark (surveying) , ranking (information retrieval) , population , evolutionary algorithm , convergence (economics) , computer science , random permutation , operator (biology) , mathematics , biology , algorithm , genetics , artificial intelligence , combinatorics , geography , block (permutation group theory) , geodesy , repressor , economic growth , transcription factor , economics , demography , sociology , gene
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here