An Improved Genghis Khan Shark Optimization Algorithm for Solving Optimization Problems

As an innovative metaheuristic algorithm, Genghis Khan Shark Optimization (GKSO) faces challenges, including a tendency towards local optima and poor convergence speed and accuracy. To mitigate these limitations, an improved Genghis Khan shark optimizer (IGKSO) is proposed in this paper. A population partitioning method based on cosine similarity and fitness is introduced, where individuals are strategically assigned to different evolutionary phases: Disadvantaged populations are responsible for the foraging stage. By contrast, advantaged populations dominate the moving stage. In the moving stage, the base vector is randomly selected from multiple candidates, which ensures the evolutionary direction of the population while maintaining its diversity. An adaptive step-size mechanism is introduced to avoid boundary overflow problems. A subspace method is employed to prevent diversity loss during foraging. Additionally, in the hunting stage, a novel opposition-based learning strategy is proposed to moderate the tendency of converging to suboptimal solutions. Furthermore, during the self-protection phase, a criterion for assessing the diversity of the whole population is employed to monitor and supplement diversity in real time. The results of the CEC2017 and CEC2019 benchmark test sets reveal that IGKSO exhibits substantial advantages over the GKSO algorithm and eight other high-performance algorithms in terms of convergence speed and accuracy.