A framework for multi-objective optimisation based on a new self-adaptive particle swarm optimisation algorithm

Show simple item record

dc.contributor.author Tang, Biwei
dc.contributor.author Zhu, Zhanxia
dc.contributor.author Shin, Hyo-Sang
dc.contributor.author Tsourdos, Antonios
dc.contributor.author Luo, Jianjun
dc.date.accessioned 2017-10-10T13:38:29Z
dc.date.available 2017-10-10T13:38:29Z
dc.date.issued 2017-08-24
dc.identifier.citation Tang B, Zhua Z, Shin H-S, Tsourdos A, Luo J, A framework for multi-objective optimisation based on a new self-adaptive particle swarm optimisation algorithm, Information Services, Vol. 420, December 2017, pp. 364-385 en_UK
dc.identifier.issn 0020-0255
dc.identifier.uri http://dx.doi.org/10.1016/j.ins.2017.08.076
dc.identifier.uri https://dspace.lib.cranfield.ac.uk/handle/1826/12608
dc.description.abstract This paper develops a particle swarm optimisation (PSO) based framework for multi-objective optimisation (MOO). As a part of development, a new PSO method, named self-adaptive PSO (SAPSO), is first proposed. Since the convergence of SAPSO determines the quality of the obtained Pareto front, this paper analytically investigates the convergence of SAPSO and provides a parameter selection principle that guarantees the convergence. Leveraging the proposed SAPSO, this paper then designs a SAPSO-based MOO framework, named SAMOPSO. To gain a well-distributed Pareto front, we also design an external repository that keeps the non-dominated solutions. Next, a circular sorting method, which is integrated with the elitist-preserving approach, is designed to update the external repository in the developed MOO framework. The performance of the SAMOPSO framework is validated through 12 benchmark test functions and a real-word MOO problem. For rigorous validation, the performance of the proposed framework is compared with those of four well-known MOO algorithms. The simulation results confirm that the proposed SAMOPSO outperforms its contenders with respect to the quality of the Pareto front over the majority of the studied cases. The non-parametric comparison results reveal that the proposed method is significantly better than the four algorithms compared at the confidence level of 90% over the 12 test functions. en_UK
dc.language.iso en en_UK
dc.publisher Elsevier en_UK
dc.rights Attribution-NonCommercial-NoDerivatives 4.0 International
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subject Multi-objective optimisation en_UK
dc.subject Self-adaptive particle swarm optimisation en_UK
dc.subject Convergence of particle swarm optimisation en_UK
dc.subject Circular sorting method en_UK
dc.title A framework for multi-objective optimisation based on a new self-adaptive particle swarm optimisation algorithm en_UK
dc.type Article en_UK
dc.identifier.cris 18348389


Files in this item

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 International Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International

Search CERES


Browse

My Account

Statistics