Gaussian Mutation-based Whale Optimization Algorithm for Benchmark Function Optimization and Neural Network Classification
摘要
The standard Whale Optimization Algorithm (WOA) is simple and widely used, but it can lose population diversity and converge prematurely when solving complex, multimodal, or high-dimensional optimization problems. This weakness is important because unstable optimization can reduce the reliability of benchmark-function solutions and neural network classification models. To address this problem, this study proposes a Gaussian mutation-based Improved Whale Optimization Algorithm (IWOA). The proposed mutation operator introduces controlled random perturbation into the search process so that search agents can escape stagnant regions while preserving the simple structure of the original WOA. IWOA was evaluated on 19 benchmark functions with dimensions of 10, 20, 30, 40, and 50 and was compared under identical conditions with Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), Bat Algorithm (BA), Seagull Optimization Algorithm (SOA), and standard WOA. The results show that IWOA achieved the best overall average rank and improved the standard WOA on 66 out of 95 function-dimensional cases, with 11 ties. Friedman testing confirmed significant differences among algorithms (