A many-objective particle swarm optimisation algorithm based on convergence assistant strategy
Wusi Yang, Li Chen, Yanyan Li, Fazeel Abid
Abstract
The multi-objective particle swarm optimisation algorithm based on Pareto dominance also has specific dilemmas when dealing with many-objective optimisation problems. For example, how to make the algorithm more effectively approach the true Pareto front, and maintain the diversity of solutions. This paper proposes a convergence assistance framework that couples different convergence operators separately to handle many-objective optimisation problems. To maintain the convergence and diversity of populations in the environmental selection, random sampling was performed on the population obtained by the shift density estimation and vector angle. The proposed algorithm is compared with several advanced many-objective optimisation algorithms on test suites DTLZ and MaF with 4, 6, 8, 10 and 15 objectives. The experimental results show that the proposed algorithm has better convergence and diversity, outperforms most of the comparison algorithms, and verifies the robustness of the algorithm framework.