.png){kind=icon}
.png){kind=icon}
Return
Improved differential evolution with dynamic mutation parameters
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-023-09080-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Differential evolution (DE) algorithms tend to be limited to local optimization when solving complex optimization problems. Different iteration schemes lead to different convergence speeds. In this paper, we mainly use the dynamic mutation parameter FS to improve the DE algorithm. Based on two ideas, a total of seven DE schemes are proposed to optimize the DE algorithm. We test the performance of the improved DE scheme on 56 test functions. Experiments show that the improved DE algorithm is better than the baseline DE algorithm in terms of accuracy, convergence and8 convergence speed.
Keywords:
Differential evolution (DE) Algorithm
Global optimization
Scheme optimization
Test function