Whale swarm algorithm with the mechanism of identifying and escaping from extreme points for multimodal function optimization

Abstract

Most real-world optimization problems often come with multiple global optima or local optima. Therefore, increasing niching metaheuristic algorithms, which devote to finding multiple optima in a single run, are developed to solve these multimodal optimization problems. However, there are two difficulties urgently to be solved for most existing niching metaheuristic algorithms: how to set the niching parameter valules for different optimization problems, and how to jump out of the local optima efficiently. These two difficulties limit their practicality largely. Based on Whale Swarm Algorithm (WSA) we proposed previously, this paper presents a new multimodal optimizer named WSA with Iterative Counter (WSA-IC) to address these two difficulties. On the one hand, WSA-IC improves the iteration rule of the original WSA for multimodal optimization, which removes the need of specifying different values of attenuation coefficient for different problems to form multiple subpopulations, without introducing any niching parameter. On the other hand, WSA-IC enables the identification of extreme points during the iterations relying on two new parameters (i.e., stability threshold T s and fitness threshold T f ), to jump out of the located extreme points. Moreover, the convergence of WSA-IC is proved. Finally, the proposed WSA-IC is compared with several niching metaheuristic algorithms on CEC2015 niching benchmark test functions and on five additional high-dimensional multimodal functions. The experimental results demonstrate that WSA-IC statistically outperforms other niching metaheuristic algorithms on most test functions.Keywords Whale swarm algorithm · multimodal optimization · metaheuristic algorithm · niching · extreme point 1 IntroductionMost of the real-world optimization problems are multimodal [1-8], i.e., their objective functions have multiple global optima or local optima. If applying traditional numerical

A Knowledge-Based Hybrid Approach on Particle Swarm Optimization Using Hidden Markov Models

“…Hop-field neural networks were used in [53] to initiate solutions of a genetic algorithm applied to the economic dispatch problem. A mechanism for identifying and escaping from extreme points is punished in [54]. Here, the whale swarm algorithm includes new procedures to iteratively discard the attenuation coefficient and it enables the identification of extreme points during the run.…”

Whale Optimization Algorithm for Multiconstraint Second-Order Stochastic Dominance Portfolio Optimization

“…Therefore, the strong constraint optimization problem has a high demand on the ability of the algorithm to jump out of the local optimum and the ability of global search [ 49 ]. According to the experimental results in this section, under different upper bounds, the value of the objective function obtained by WOA is better in both the optimal conditions [ 50 , 51 ]. This shows that the performance of WOA is better than that of the other four algorithms in strongly constrained optimization problems, which has an excellent application prospect.…”

An interval type-2 fuzzy logic controller design method for hydraulic actuators of a human-like robot by using improved drone squadron optimization

“…The mutation strategy often lead to local optimal especially when the number of individual is few. Based on this fact, a new reference firmware as shown in equation (19) is proposed, which was inspired by whale swarm algorithm with iteration counter (WSA-IC) proposed by Zeng et al, 35 where U (0, 1) denotes a matrix of uniform distribution with the range of 0–1 and CBP r x denotes current best position of random sequence r x ( x = 1, 2, 3). Compared with DE/rand/1, the searching region of this mutation strategy is bigger, so the global searching ability of IDSO is better than DSO …”