Search

Aiming at the problem that the WOA was easy to fall into local optimum and low convergence precision, this paper proposed an improved whale optimization algorithm (IWOA). The algorithm initialized the population by quasi-reverse learning methods and improved the diversity of the population. Then the algorithm modified the linear convergence factor to a nonlinear convergence factor, which was beneficial to balance the global search ability and local development ability. In addition, the algorithm improved the local search ability of the whale optimization algorithm by increasing the adaptive weight and imp roved convergence precision. Finally, the algorithm adjusted the whale optimization algorithm in time by a random differential mutation strategy to avoid falling into the local optimum. It selected nine benchmark functions in the experiment, and iterated all the algorithms 30 times. The improved whale optimization algorithm compared to the original whale optimization algorithm and five improved whale optimization algorithms, the results show that the mean and standard deviation of the algorithm are better than other algorithms, the convergence curve of the algorithm is also superior to most other algorithms. It shows that the imp roved whale optimization algorithm has the best convergence accuracy and algorithm stability, and the convergence speed is significantly faster than most other improved whale optimization algorithms. [ABSTRACT FROM AUTHOR]

In order to solve the problems of slow search speed, premature convergence and low search accuracy of standard whale optimization algorithm, this paper proposed a hybrid strategy to improve whale optimization algorithm. Firstly, it increased the population diversity by generating the initial population with chaotic map, which laid a foundation for the algorithm global search. Then, by the non-linear strategy, it improved the convergence factor and inertia weight to balance the global exploration, local development ability of the algorithm and accelerated the convergence speed. Finally, according to the variance of the group fitness, it set the threshold performing the mutation operation to avoid the premature convergence of the algorithm. By testing 12 typical benchmark functions in three aspects, the experimental results show that the improved algorithm has a remarkable enhancement in search speed and convergence accuracy. Besides, it has a strong ability to get rid of falling into local optimum. [ABSTRACT FROM AUTHOR]

Aiming at the shortages of the basic whale optimization algorithm with low optimization precision, slow convergence speed and easy to fall into local optimum, this paper proposed a new algorithm based on dynamic search and cooperative learning. Firstly, it used equivalent replacement and Faure sequences to enhance the quality of initial solution. Secondly, it improved the population diversity and enhanced the ability to jump out of local optimal solutions through the division of population. Finally, in order to improve the convergence rate and precision, it dynamically adjusted the search strategy of the algorithms according to the population evolutionary information. The experimental results show that the proposed algorithm is much better than basic whale optimization algorithm and its several improved algorithms in optimization performance. [ABSTRACT FROM AUTHOR]

In order to improve the performance of whale optimization algorithm for solving complex function optimization problems, this paper proposed an improved whale optimization algorithm based on adaptive parameters and niche technology. Firstly, the algorithm introduced an adaptive probability threshold to coordinate the global exploration and local development abilities. Then, the algorithm used adaptive position weights to adjust the whale position update formula to improve the convergence speed and search precision. Finally, the algorithm used preselection niche technology to avoid premature convergence. The results on 12 typical benchmark functions show that the improved algorithm has faster convergence speed and higher search precision than other comparison algorithms. It proves that the improvement strategy can effectively improve the performance of the whale optimization algorithm for solving complex function optimization problems. [ABSTRACT FROM AUTHOR]

In order to solve the disadvantage of the traditional whale optimization algorithm, which is slow convergence and easy to fall into local optimum, this paper proposed a mixed strategy based whale optimization algorithm. Firstly, it introduced the nonlinear adjustment strategy to modify the convergence factor, balanced the exploration and exploitation capability and accelerated the convergence speed. Then, it introduced an adaptive weighted coefficient into the position update formula of whales to improve the search precision of the algorithm. Finally, it combined the limit threshold idea of artificial bee colony algorithm to effectively jump out of the local optimum and prevent premature convergence. The results show that the proposed algorithm has better search precision and convergence speed through experiments on different dimensions of 14 benchmark functions. [ABSTRACT FROM AUTHOR]