A Differential Evolution Algorithm with a Variable Neighborhood Search for Constrained Function Optimization

Author(s):  
M. Fatih Tasgetiren ◽  
P. N. Suganthan ◽  
Sel Ozcan ◽  
Damla Kizilay
2016 ◽  
Vol 835 ◽  
pp. 847-857 ◽  
Author(s):  
Wen Bo Liu

Permutation flowshop scheduling problem (PFSP) is a classical NP-hard combinatorial optimization problem, which provides a challenge for evolutionary algorithms.Since it has been shown that simple evolutionary algorithms cannot solve the PFSP efficiently, local search methods are often adopted to improve the exploitation ability of evolutionary algorithms. In this paper, a hybrid differential evolution algorithm is developed to solve this problem. This hybrid algorithm is designed by incorporating a dynamic variable neighborhood search (DVNS) into the differential evolution. In the DVNS, the neighborhood is based on multiple moves and its size can be dynamically changed from small to large so as to obtain a balance between exploitation and exploration. In addition, a population monitoring and adjusting mechanism is also incorporated to enhance the search diversity and avoid being trapped in local optimum.Experimental results on benchmark problems illustrated the efficiency of the proposed algorithm.


2013 ◽  
Vol 12 (3) ◽  
pp. 444-448 ◽  
Author(s):  
Chao-Xue Wang ◽  
Chang-Hua Li ◽  
Hui Dong ◽  
Fan 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.


Sign in / Sign up

Export Citation Format

Share Document