scholarly journals A Hybrid Whale Optimization Algorithm for Global Optimization

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1477
Author(s):  
Chun-Yao Lee ◽  
Guang-Lin Zhuo
Keyword(s):  
Global Optimization ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Whale Optimization Algorithm ◽  
Initial Population ◽  
Test Functions ◽  
Benchmark Test ◽  
Thermal Exchange ◽  
Whale Optimization ◽  
Benchmark Test Functions

This paper proposes a hybrid whale optimization algorithm (WOA) that is derived from the genetic and thermal exchange optimization-based whale optimization algorithm (GWOA-TEO) to enhance global optimization capability. First, the high-quality initial population is generated to improve the performance of GWOA-TEO. Then, thermal exchange optimization (TEO) is applied to improve exploitation performance. Next, a memory is considered that can store historical best-so-far solutions, achieving higher performance without adding additional computational costs. Finally, a crossover operator based on the memory and a position update mechanism of the leading solution based on the memory are proposed to improve the exploration performance. The GWOA-TEO algorithm is then compared with five state-of-the-art optimization algorithms on CEC 2017 benchmark test functions and 8 UCI repository datasets. The statistical results of the CEC 2017 benchmark test functions show that the GWOA-TEO algorithm has good accuracy for global optimization. The classification results of 8 UCI repository datasets also show that the GWOA-TEO algorithm has competitive results with regard to comparison algorithms in recognition rate. Thus, the proposed algorithm is proven to execute excellent performance in solving optimization problems.

scholarly journals Improved Whale Optimization Algorithm Based on Inertia Weights for Solving Global Optimization Problems

2020 ◽  
Vol 5 (3) ◽  
pp. 147-155
Author(s):  
I-Ming Chao ◽  
Shou-Cheng Hsiung ◽  
Jenn-Long Liu
Keyword(s):  
Global Optimization ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Whale Optimization Algorithm ◽  
Humpback Whales ◽  
Position Vector ◽  
Hunting Behavior ◽  
Inertia Weight ◽  
Whale Optimization ◽  
Solution Accuracy

Whale Optimization Algorithm (WOA) is a new kind of swarm-based optimization algorithm that mimics the foraging behavior of humpback whales. WOA models the particular hunting behavior with three stages: encircling prey, bubble-net attacking, and search for prey. In this work, we proposed a new linear decreasing inertia weight with a random exploration ability (LDIWR) strategy. It also compared with the other three inertia weight WOA (IWWOA) methods: constant inertia weight (CIW), linear decreasing inertia weight (LDIW), and linear increasing inertia weight (LIIW) by adding fixed or linear inertia weights to the position vector of the reference whale. The four IWWOAs are tested with 23 mathematical and theoretical optimization benchmark functions. Experimental results show that most of IWWOAs outperform the original WOA in terms of solution accuracy and convergence rate when solving global optimization problems. Accordingly, the LDIWR strategy produces a better balance between exploration and exploitation capabilities for multimodal functions.

scholarly journals Opposition-Based Multi-Objective Whale Optimization Algorithm with Multi-Leader Guiding

2021 ◽  
Author(s):  
Yang Li ◽  
Wei-gang Li ◽  
Yun-tao Zhao ◽  
Ao Liu
Keyword(s):  
Optimization Algorithm ◽  
Pareto Front ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Whale Optimization Algorithm ◽  
Benchmark Problems ◽  
Initial Population ◽  
Multi Objective ◽  
Opposition Based Learning ◽  
Whale Optimization

Abstract Over the years, heuristic algorithms have been widely studied, especially in multi-objective optimization problems (MOPs). The multi-objective whale optimization algorithm based on multi-leader guiding (MOWOAMLG) is proposed in this paper, which is the multi-objective version of whale optimization algorithm (WOA). The proposed algorithm adopts several improvements to enhance optimization performance. First, multiple leadership solutions guide the population to search the sparse space to achieve more homogeneous exploration in per iteration, and the leadership solutions are selected on the Pareto front by grid mechanism and the principle of maximum crowding distance. Second, the differential evolution (DE) is employed to generate the offspring for the leadership solutions, while WOA is employed for the ordinary solutions. In addition, a novel opposition-based learning (OBL) strategy is developed to improve the distribution of the initial population. To show the significance of the proposed algorithm, it is tested on the 20 bi-objective and tri-objective unconstrained benchmark problems of varying nature and complexities. The result of numerical experiments shows that the proposed algorithm has competitive advantages in convergence and distribution while compared with other 10 classic or state-of-the-arts algorithms. The convergence curve of IGD indicates that MOWOAMLG is able to obtain good Pareto front in cost of fewer optimization iterations. Moreover, it is tested on load distribution of hot rolling, and the result proves its good performance in real-world applications. Thus, all of the aforementioned results have indicated that MOWOAMLG is comparatively effective and efficient to solve MOPs.

scholarly journals Improved Whale Optimization Algorithm for Solving Constrained Optimization Problems

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Gui-Ying Ning ◽  
Dun-Qian Cao
Keyword(s):  
Constrained Optimization ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Convergence Speed ◽  
Whale Optimization Algorithm ◽  
Initial Population ◽  
Local Optimum ◽  
Penalty Function Method ◽  
Constrained Optimization Problems ◽  
Whale Optimization

In view of the shortcomings of the whale optimization algorithm (WOA), such as slow convergence speed, low accuracy, and easy to fall into local optimum, an improved whale optimization algorithm (IWOA) is proposed. First, the standard WOA is improved from the three aspects of initial population, convergence factor, and mutation operation. At the same time, Gaussian mutation is introduced. Then the nonfixed penalty function method is used to transform the constrained problem into an unconstrained problem. Finally, 13 benchmark problems were used to test the feasibility and effectiveness of the proposed method. Numerical results show that the proposed IWOA has obvious advantages such as stronger global search ability, better stability, faster convergence speed, and higher convergence accuracy; it can be used to effectively solve complex constrained optimization problems.

Sign in / Sign up

Export Citation Format

Share Document