TY - JOUR
T1 - Several characteristics analysis of particle swarm optimizer
AU - Pan, Feng
AU - Chen, Jie
AU - Xin, Bin
AU - Zhang, Juan
PY - 2009/7
Y1 - 2009/7
N2 - Particle swarm optimizer (PSO), a swarm intelligence based optimization technique, is described by a general formula in terms of iterations in the paper. Based on the general formula, its optimization mechanism is analyzed and the general mathematic description of particle's maximum covering space is deduced according to the current social information and personal experience. Furthermore, the general formula is illustrated as the weighted summation of historical position states, so as to prove that in terms of cumulative iterations, parameters of PSO have an inherent forgetting characteristic in probability, moreover the searching mechanisms of canonical PSO and Bare-bones particle swarm are almost the same. From the perspective of information propagation, the strategy of PSO is a weighted summation of the historical information, which has the forgetting characteristic in probability. Some important properties of canonical PSO, such as forgetting characteristic, similarity between canonical PSO and BBPS, etc, are explained by the results of the research in this paper.
AB - Particle swarm optimizer (PSO), a swarm intelligence based optimization technique, is described by a general formula in terms of iterations in the paper. Based on the general formula, its optimization mechanism is analyzed and the general mathematic description of particle's maximum covering space is deduced according to the current social information and personal experience. Furthermore, the general formula is illustrated as the weighted summation of historical position states, so as to prove that in terms of cumulative iterations, parameters of PSO have an inherent forgetting characteristic in probability, moreover the searching mechanisms of canonical PSO and Bare-bones particle swarm are almost the same. From the perspective of information propagation, the strategy of PSO is a weighted summation of the historical information, which has the forgetting characteristic in probability. Some important properties of canonical PSO, such as forgetting characteristic, similarity between canonical PSO and BBPS, etc, are explained by the results of the research in this paper.
KW - Forgetting characteristic
KW - Maximum covering space
KW - Particle swarm optimizer (PSO)
KW - Similarity
UR - https://www.scopus.com/pages/publications/68049115557
U2 - 10.3724/SP.J.1004.2009.01010
DO - 10.3724/SP.J.1004.2009.01010
M3 - Article
AN - SCOPUS:68049115557
SN - 0254-4156
VL - 35
SP - 1010
EP - 1016
JO - Zidonghua Xuebao/Acta Automatica Sinica
JF - Zidonghua Xuebao/Acta Automatica Sinica
IS - 7
ER -