.png){kind=icon}
.png){kind=icon}
Return
Adaptive differential evolution with ensembling operators for continuous optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2021.100994.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Differential evolution is one of the most popular evolutionary algorithms for continuous optimization. In this paper, we introduce a new algorithm named the adaptive differential evolution with ensembling populations. In the proposed algorithm, two sets of mutation and crossover operators are utilized to generate offspring to better balance the exploitation and exploration abilities of the algorithm. Besides, an adaptive parameter control strategy is integrated to dynamically adjust the parameter setting of the algorithm so as to further improve the search efficacy. In the experimental studies, it is demonstrated that the proposed algorithm presents competitive performance on benchmark functions as well as on the real-world wireless sensor localization application, in terms of global search ability and search efficiency.
Keywords:
Differential evolution
Adaptive control strategy
Continuous optimization problem
Benchmark functions
Wireless sensor localization
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W