Solving many-objective optimisation problems by an improved particle swarm optimisation approach and a normalised penalty method Online publication date: Tue, 03-Dec-2019
by Dexuan Zou; Fei Wang; Nannan Yu; Xiangyong Kong
International Journal of Bio-Inspired Computation (IJBIC), Vol. 14, No. 4, 2019
Abstract: In this paper, a novel modified particle swarm optimisation (NMPSO) approach is presented to handle the many-objective knapsack (MOK) problem. NMPSO relies on the global best particle to guide the search of all particles in each generation. Furthermore, a randomisation-based mutation is adopted to overcome the premature convergence. A normalised penalty method (NPM) is devised to reach a compromise between objective functions and inequality constraints, which enables particles to explore solution space more precisely. In summary, the contribution of our work can be summarised in two aspects: 1) a more powerful approach called NMPSO is proposed; 2) a reasonable NPM is devised. Five improved PSOs are used to handle the MOKs with different number of objective functions and dimensions. Experimental results show that NMPSO has higher efficiency than the other four approaches. It uses the lowest computational cost and achieves the smallest penalty function values for most MOKs.
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