A many-objective particle swarm optimisation algorithm based on convergence assistant strategy Online publication date: Mon, 07-Nov-2022
by Wusi Yang; Li Chen; Yanyan Li; Fazeel Abid
International Journal of Bio-Inspired Computation (IJBIC), Vol. 20, No. 2, 2022
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook