TY - GEN
T1 - Dimensions cooperate by Euclidean metric in Particle Swarm Optimization
AU - Li, Zezhou
AU - Zhang, Junqi
AU - Wang, Wei
AU - Yao, Jing
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/9/16
Y1 - 2014/9/16
N2 - Since Particle Swarm Optimization (PSO) was introduced, variants of PSO have usually updated velocities of particles in each dimension independently in the high-dimensional space. This paper proposes a Dimensionally Cooperative PSO (DCPSO), in which dimensions cooperate to update velocities of particles through Euclidean metric. The Euclidean metric first builds pbest-centered and gbest-centered hyperspheres. And then, velocity vectors of particles are derived from stochastic points obeying a distribution within the hyperspheres for dimensions cooperating. DCPSO investigates such cooperation of dimensions through Euclidean metric, instead of updating each dimension independently. Compared with the traditional PSO, DCPSO is validated by simulations on the 20 standard benchmark problems from CEC 2013. Furthermore, DCPSO shows more rotationally-invariant than the traditional PSO from the results. Additionally, the differences between the behaviors of the traditional PSO and the proposed DCPSO are analyzed from the aspect of the search space. Meanwhile, the curse of dimensionality is illustrated by comparisons between the traditional PSO and DCPSO in distinct dimensions.
AB - Since Particle Swarm Optimization (PSO) was introduced, variants of PSO have usually updated velocities of particles in each dimension independently in the high-dimensional space. This paper proposes a Dimensionally Cooperative PSO (DCPSO), in which dimensions cooperate to update velocities of particles through Euclidean metric. The Euclidean metric first builds pbest-centered and gbest-centered hyperspheres. And then, velocity vectors of particles are derived from stochastic points obeying a distribution within the hyperspheres for dimensions cooperating. DCPSO investigates such cooperation of dimensions through Euclidean metric, instead of updating each dimension independently. Compared with the traditional PSO, DCPSO is validated by simulations on the 20 standard benchmark problems from CEC 2013. Furthermore, DCPSO shows more rotationally-invariant than the traditional PSO from the results. Additionally, the differences between the behaviors of the traditional PSO and the proposed DCPSO are analyzed from the aspect of the search space. Meanwhile, the curse of dimensionality is illustrated by comparisons between the traditional PSO and DCPSO in distinct dimensions.
UR - https://www.scopus.com/pages/publications/84908600406
U2 - 10.1109/CEC.2014.6900430
DO - 10.1109/CEC.2014.6900430
M3 - 会议稿件
AN - SCOPUS:84908600406
T3 - Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
SP - 1359
EP - 1366
BT - Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE Congress on Evolutionary Computation, CEC 2014
Y2 - 6 July 2014 through 11 July 2014
ER -