An improved multi-objective particle swarm optimization algorithm for the design of foundation pit of rail transit upper cover project.

In this study, a multi-objective particle swarm optimization (MOIPSO) algorithm is proposed to address complex optimization problems, including real-world engineering challenges. The algorithm retains the basic convergence mechanism of particle swarm optimization (PSO) as its core, while innovatively combining the fast non-dominated sorting technique to effectively evaluate and approximate the Pareto optimal solution set. To enhance the diversity and generalization of the solution set, the crowding distance mechanism is introduced, ensuring a good balance between multiple optimization objectives and a wider coverage of the solution space. Additionally, an acceleration factor based on trigonometric functions and an adaptive Gaussian mutation strategy are incorporated, improving the exploration ability of the particles in the search space and facilitating their movement towards the global optimal solution more effectively. The performance of the algorithm is verified using the multi-modal multi-objective benchmark function set provided by CEC2020, and comparisons are made with five advanced multi-objective metaheuristics. The MOIPSO algorithm is also applied to solve the design problem of rail transit upper cover foundation pit, further demonstrating the practical effectiveness of the proposed algorithm. The results show that MOIPSO not only performs well in multi-objective function testing but also proves highly competitive in solving real-world engineering problems. Note that the source codes of MOGWO are publicly available at https://au.mathworks.com/matlabcentral/fileexchange/177404-moipso-optimization-engineering-problem .