Analysis of Parallel Sub-swarm PSO with the Same Total Particle Numbers
- Resource Type
- Conference
- Authors
- Hong, Tzung-Pei; Chen, Jui-Chi; Lin, Wen-Yang; Chen, Chun-Hao
- Source
- 2015 18th International Conference on Network-Based Information Systems Network-Based Information Systems (NBiS), 2015 18th International Conference on. :616-619 Sep, 2015
- Subject
- Computing and Processing
Particle swarm optimization
Algorithm design and analysis
Computer science
Clustering algorithms
Approximation algorithms
Parallel algorithms
particle swarm optimization
parallel processing
sub-swarm
particle number
- Language
In this paper, we re-visit the parallel PSO schemes and adopt a different perspective to parallelize PSO. In the adopted scheme, the original particle swarm is divided into several sub-swarms under the condition that the total particle numbers are the same, thus keeping nearly the same computational tasks. Each slave processor then individually runs a part of the sub-swarms. Experiments are also conducted to show the property and the performance of the scheme.