An Efficient Multi-Objective White Shark Algorithm

To balance the diversity and stringency of Pareto solutions in multi-objective optimization, this paper introduces a multi-objective White Shark Optimization algorithm (MONSWSO) tailored for multi-objective optimization. MONSWSO integrates non-dominated sorting and crowding distance into the White Shark Optimization framework to select the optimal solution within the population. The uniformity of the initial population is enhanced through a chaotic reverse initialization learning strategy. The adaptive updating of individual positions is facilitated by an elite-guided forgetting mechanism, which incorporates escape energy and eddy aggregation behavior inspired by marine organisms to improve exploration in key areas. To evaluate the effectiveness of MONSWSO, it is benchmarked against five state-of-the-art multi-objective algorithms using four metrics: inverse generation distance, spatial homogeneity, spatial distribution, and hypervolume on 27 typical problems, including 23 multi-objective functions and 4 multi-objective project examples. Furthermore, the practical application of MONSWSO is demonstrated through an example of optimizing the design of subway tunnel foundation pits. The comprehensive results reveal that MONSWSO outperforms the comparison algorithms, achieving impressive and satisfactory outcomes.