A Minimum-Elimination-Escape Function Method for Multimodal Optimization Problems

Author(s):  
Lei Fan ◽  
Xiyang Liu ◽  
Liping Jia
2015 ◽  
Vol 2015 ◽  
pp. 1-16
Author(s):  
Lei Fan ◽  
Yuping Wang ◽  
Xiyang Liu ◽  
Liping Jia

Auxiliary function methods provide us effective and practical ideas to solve multimodal optimization problems. However, improper parameter settings often cause troublesome effects which might lead to the failure of finding global optimal solutions. In this paper, a minimum-elimination-escape function method is proposed for multimodal optimization problems, aiming at avoiding the troublesome “Mexican hat” effect and reducing the influence of local optimal solutions. In the proposed method, the minimum-elimination function is constructed to decrease the number of local optimum first. Then, a minimum-escape function is proposed based on the minimum-elimination function, in which the current minimal solution will be converted to the unique global maximal solution of the minimum-escape function. The minimum-escape function is insensitive to its unique but easy to adopt parameter. At last, an minimum-elimination-escape function method is designed based on these two functions. Experiments on 19 widely used benchmarks are made, in which influences of the parameter and different initial points are analyzed. Comparisons with 11 existing methods indicate that the performance of the proposed algorithm is positive and effective.


2021 ◽  
Vol 12 (4) ◽  
pp. 81-100
Author(s):  
Yao Peng ◽  
Zepeng Shen ◽  
Shiqi Wang

Multimodal optimization problem exists in multiple global and many local optimal solutions. The difficulty of solving these problems is finding as many local optimal peaks as possible on the premise of ensuring global optimal precision. This article presents adaptive grouping brainstorm optimization (AGBSO) for solving these problems. In this article, adaptive grouping strategy is proposed for achieving adaptive grouping without providing any prior knowledge by users. For enhancing the diversity and accuracy of the optimal algorithm, elite reservation strategy is proposed to put central particles into an elite pool, and peak detection strategy is proposed to delete particles far from optimal peaks in the elite pool. Finally, this article uses testing functions with different dimensions to compare the convergence, accuracy, and diversity of AGBSO with BSO. Experiments verify that AGBSO has great localization ability for local optimal solutions while ensuring the accuracy of the global optimal solutions.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 178322-178335
Author(s):  
Zhao Hong ◽  
Zong-Gan Chen ◽  
Dong Liu ◽  
Zhi-Hui Zhan ◽  
Jun Zhang

Sign in / Sign up

Export Citation Format

Share Document