TY - GEN
T1 - Parallel particle swarm optimization algorithm based on spatial equal-scale segmentation and hybrid strategy
AU - Tian, Luogeng
AU - Yang, Bailong
AU - Zhang, Bin
AU - Wang, Yuan
AU - Hai, Tao
AU - He, Jingyuan
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/3
Y1 - 2021/3
N2 - According to the characteristics of classical PSO algorithm(s), this paper uses the spatial equal-scale segmentation method (PESS) to effectively reduce the data dimension because of the low efficiency of PSO algorithm caused by big data and large population size. Diversity selection and global optimization, according to the law of evolution selection, the local optimization is focused on the two extremes of minimum value and maximal value, thus reducing the number of calculations of the fitness function of the algorithm. On this basis, we introduce a time-hop and elite Gaussian mixture strategy that can overcome the particle plunging into local optimum, while improving the efficiency of the algorithm, the generalization ability of the algorithm is taken into account. In order to prove the performance of FSPSO, we chose PSO and the self-organizing migration algorithm (SOMA) evolved from PSO that were tested in 30, 60 and 100 comparison tests on 5 different test function set with different degrees of complexity. The experimental results show that we proposed FSPSO algorithm has good effectiveness, robustness, complexity and universality in solving global optimization problems.
AB - According to the characteristics of classical PSO algorithm(s), this paper uses the spatial equal-scale segmentation method (PESS) to effectively reduce the data dimension because of the low efficiency of PSO algorithm caused by big data and large population size. Diversity selection and global optimization, according to the law of evolution selection, the local optimization is focused on the two extremes of minimum value and maximal value, thus reducing the number of calculations of the fitness function of the algorithm. On this basis, we introduce a time-hop and elite Gaussian mixture strategy that can overcome the particle plunging into local optimum, while improving the efficiency of the algorithm, the generalization ability of the algorithm is taken into account. In order to prove the performance of FSPSO, we chose PSO and the self-organizing migration algorithm (SOMA) evolved from PSO that were tested in 30, 60 and 100 comparison tests on 5 different test function set with different degrees of complexity. The experimental results show that we proposed FSPSO algorithm has good effectiveness, robustness, complexity and universality in solving global optimization problems.
KW - FSPSO
KW - Particle swarm optimization
KW - Spatial equal-scale segmentation
KW - Subgroup
KW - Time-selective hopping strategy
UR - https://www.scopus.com/pages/publications/85114015935
U2 - 10.1109/AEMCSE51986.2021.00165
DO - 10.1109/AEMCSE51986.2021.00165
M3 - Conference contribution
AN - SCOPUS:85114015935
T3 - Proceedings - 2021 4th International Conference on Advanced Electronic Materials, Computers and Software Engineering, AEMCSE 2021
SP - 801
EP - 810
BT - Proceedings - 2021 4th International Conference on Advanced Electronic Materials, Computers and Software Engineering, AEMCSE 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 4th International Conference on Advanced Electronic Materials, Computers and Software Engineering, AEMCSE 2021
Y2 - 26 March 2021 through 28 March 2021
ER -