An enhanced whale optimization algorithm for large scale optimization problems

Whale optimization algorithm was developed based on the prey-catching characteristics of the humpback whales. Due to its simple structure and efficiency, the researchers employed the algorithm to address numerous disciplines’ numerous problems. The profound analysis of the whale optimization algorithm discloses that the algorithm suffers from low exploration ability, lesser accuracy, and early convergence. Additionally, performance of the whale optimization algorithm and most of its variants in high-dimensional optimization problems is not satisfactory. This study proposes a new variant with several modifications to the basic whale optimization algorithm to solve high-dimensional problems. A unique selection parameter is introduced in the whale optimization algorithm to balance the algorithm’s global and local search phase. The co-efficient vectors A and C are modified and used effectively to explore and exploit the search region better. In the exploration phase, random movement is allowed to reduce the computational burden of the algorithm. An inertia weight is introduced in the exploitation phase for exhaustive search nearby the best solution. The proposed algorithm evaluates twenty-five benchmark functions using dimensions 100, 500, 1000, and 2000 and compared the results with the whale optimization algorithm and its variants. The estimated outcomes are also compared with seven basic metaheuristic algorithms. Finally, statistical analysis, complexity analysis, and convergence analysis are performed to establish the algorithm’s efficacy. All the test result suggests better performance of the proposed algorithm on higher-dimensional problems.