An Efficient Differential Evolution Algorithm For Function Optimization

2013 ◽  
Vol 12 (3) ◽  
pp. 444-448 ◽  
Author(s):  
Chao-Xue Wang ◽  
Chang-Hua Li ◽  
Hui Dong ◽  
Fan Zhang
2012 ◽  
Vol 11 (1) ◽  
pp. 315-320
Author(s):  
Yiwen Zhong ◽  
Xiaoyu Lin ◽  
Lijin Wang ◽  
Hui Zhang

2011 ◽  
Vol 308-310 ◽  
pp. 2431-2435 ◽  
Author(s):  
Na Li ◽  
Yuan Xiang Li ◽  
Zhi Guo Huang ◽  
Yong Wang

In multimodal optimization, the original differential evolution algorithm is easy to duplicate and miss points of the optimal value. To solve this problem, a modified differential evolution algorithm, called niche differential evolution (NDE), is proposed. In the algorithm, the basic differential evolution algorithm is improved based on the niche technology. The rationality to construct the proposed algorithm is discussed. Shubert function, a representative multimodal optimization problem is used to verify the algorithm. The results show that the proposed algorithm can find all global optimum points quickly without strict request for parameters, so it is a good approach to find all global optimum points for multimodal functions.


2013 ◽  
Vol 12 (9) ◽  
pp. 1796-1803 ◽  
Author(s):  
Feng-Zhe Cui ◽  
Lei Wang ◽  
Zhi-Zheng Xu ◽  
Xiu-Kun Wang ◽  
Hong-Fei Teng

2010 ◽  
Vol 439-440 ◽  
pp. 315-320
Author(s):  
Zhi Gang Zhou

One of the key points resulting in the success of differential evolution (DE) is its mechanism of different mutation strategies for generating mutant vectors. In this paper, we also present a novel mutation strategy inspired by the velocity updating scheme of particle swarm optimization (PSO). The proposed approach is called HDE, which conducts the mutation strategy on the global best vector for each generation. Experimental studies on 8 well-known benchmark functions show that HDE outperforms other three compared DE algorithms in most test cases.


Sign in / Sign up

Export Citation Format

Share Document