.png){kind=icon}
.png){kind=icon}
Return
Differential evolution with two-level adaptive mechanism for numerical optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2022.108209.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a novel differential evolution algorithm by designing two prediction-based muta-tion operators and a two-level adaptive mechanism. To accelerate the search efficiency of algorithm and enhance the suitability of integrating multiple mutation operators with different characteristics, two new mutation operators are first developed to strengthen the local search ability by making full use of the neighborhood information of each individual to predict its promising region and guide the search process. Meanwhile, a two-level adaptive mechanism is designed to meet the search requirements of both individual and population by utilizing the history search information of its neighbors and that of the whole population simultaneously to assign a more suitable mutation operator for it. Moreover, an enhanced restart operation is further adopted to avoid the invalid search during the evolutionary process. Differing from the existing DE variants, the proposed algorithm incorporates the prediction process in mutation to enhance the exploitation, and simultaneously uses the local information of each individual and the global information of population to adaptively adjust the search capability. Then it could effectively improve the search efficiency and balance the exploration and exploitation. Compared with 21 typical algorithms, the numerical results on the benchmark functions from both IEEE CEC2014 and CEC2017 show that the proposed algorithm has better performance. (c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Global optimization
Differential evolution
Adaptive mechanism
Prediction process
Numerical optimization
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W