TY - JOUR
T1 - A framework for multi-objective optimisation based on a new self-adaptive particle swarm optimisation algorithm
AU - Tang, Biwei
AU - Zhu, Zhanxia
AU - Shin, Hyo Sang
AU - Tsourdos, Antonios
AU - Luo, Jianjun
N1 - Publisher Copyright:
© 2017 Elsevier Inc.
PY - 2017/12
Y1 - 2017/12
N2 - 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.
AB - 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.
KW - Circular sorting method
KW - Convergence of particle swarm optimisation
KW - Multi-objective optimisation
KW - Self-adaptive particle swarm optimisation
UR - http://www.scopus.com/inward/record.url?scp=85028349705&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2017.08.076
DO - 10.1016/j.ins.2017.08.076
M3 - 文章
AN - SCOPUS:85028349705
SN - 0020-0255
VL - 420
SP - 364
EP - 385
JO - Information Sciences
JF - Information Sciences
ER -