Multicriteria adaptive differential evolution for global numerical optimization

2015 ◽  
Vol 22 (2) ◽  
pp. 103-107 ◽  
Author(s):  
Jixiang Cheng ◽  
Gexiang Zhang ◽  
Fabio Caraffini ◽  
Ferrante Neri
Keyword(s):  
Differential Evolution ◽  
Numerical Optimization ◽  
Global Numerical Optimization ◽  
Adaptive Differential Evolution

Neighborhood-adaptive differential evolution for global numerical optimization

2017 ◽  
Vol 59 ◽  
pp. 659-706 ◽  
Author(s):  
Yiqiao Cai ◽  
Guo Sun ◽  
Tian Wang ◽  
Hui Tian ◽  
Yonghong Chen ◽  
...  
Keyword(s):  
Differential Evolution ◽  
Numerical Optimization ◽  
Global Numerical Optimization ◽  
Adaptive Differential Evolution

A decremental stochastic fractal differential evolution for global numerical optimization

2016 ◽  
Vol 372 ◽  
pp. 470-491 ◽  
Author(s):  
Noor H. Awad ◽  
Mostafa Z. Ali ◽  
Ponnuthurai N. Suganthan ◽  
Edward Jaser
Keyword(s):  
Differential Evolution ◽  
Numerical Optimization ◽  
Global Numerical Optimization

scholarly journals Success History-Based Adaptive Differential Evolution Using Turning-Based Mutation

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1565 ◽  
Author(s):  
Xingping Sun ◽  
Linsheng Jiang ◽  
Yong Shen ◽  
Hongwei Kang ◽  
Qingyi Chen
Keyword(s):  
Differential Evolution ◽  
Clustering Analysis ◽  
Numerical Optimization ◽  
Optimization Algorithms ◽  
Search Space ◽  
Population Diversity ◽  
Convergence Of Algorithms ◽  
Adaptive Differential Evolution ◽  
Complex Methods ◽  
Single Objective

Single objective optimization algorithms are the foundation of establishing more complex methods, like constrained optimization, niching and multi-objective algorithms. Therefore, improvements to single objective optimization algorithms are important because they can impact other domains as well. This paper proposes a method using turning-based mutation that is aimed to solve the problem of premature convergence of algorithms based on SHADE (Success-History based Adaptive Differential Evolution) in high dimensional search space. The proposed method is tested on the Single Objective Bound Constrained Numerical Optimization (CEC2020) benchmark sets in 5, 10, 15, and 20 dimensions for all SHADE, L-SHADE, and jSO algorithms. The effectiveness of the method is verified by population diversity measure and population clustering analysis. In addition, the new versions (Tb-SHADE, TbL-SHADE and Tb-jSO) using the proposed turning-based mutation get apparently better optimization results than the original algorithms (SHADE, L-SHADE, and jSO) as well as the advanced DISH and the jDE100 algorithms in 10, 15, and 20 dimensional functions, but only have advantages compared with the advanced j2020 algorithm in 5 dimensional functions.

Sign in / Sign up

Export Citation Format

Share Document