An Efficient and Robust Improved Whale Optimization Algorithm for Large Scale Global Optimization Problems
Citations Over TimeTop 10% of 2022 papers
Abstract
As an efficient meta-heuristic algorithm, the whale optimization algorithm (WOA) has been extensively applied to practical problems. However, WOA still has the drawbacks of converging slowly, and jumping out from extreme points especially for large scale optimization problems. To overcome these defects, a modified whale optimization algorithm integrated with a crisscross optimization algorithm (MWOA-CS) is proposed. In MWOA-CS, each dimension of the optimization problem updates its position by randomly performing improved WOA or crisscross optimization algorithm during the entire iterative process. The improved WOA adopts the new nonlinear convergence factor and nonlinear inertia weight to tune the ability of exploitation and exploration. To analyze the performance of MWOA-CS, a series of numerical experiments were performed on 30 test benchmark functions with dimension ranging from 300 to 1000. The experimental results revealed that the presented MWOA-CS provided better convergence speed and accuracy, and meanwhile, displayed a significantly more effective and robust performance than the original WOA and other state of the art meta-heuristic algorithms for solving large scale global optimization problems.
Related Papers
- → A Benchmark Characterization of the EEMBC Benchmark Suite(2009)218 cited
- → Solutions to the Third Benchmark Control Problem(1991)3 cited
- Theoretical Analysis of the Benchmark for Choosing Manipulative Instruments of Monetary Policies(2009)
- → Exploring disk performance benchmarks(2017)
- → Support Structure Performance Benchmark(2023)