Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1109/NBiS.2015.92 | NBiS |
Keywords | Field | DocType |
particle swarm optimization, parallel processing, sub-swarm, particle number | Particle swarm optimization,Particle number,Mathematical optimization,Swarm behaviour,Parallel metaheuristic,Computer science,Parallel processing,Parallel computing,Multi-swarm optimization,Particle,Metaheuristic,Distributed computing | Conference |
ISSN | Citations | PageRank |
2157-0418 | 1 | 0.35 |
References | Authors | |
5 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Tzung-pei Hong | 1 | 3768 | 483.06 |
Jui-Chi Chen | 2 | 1 | 0.35 |
Wen-Yang Lin | 3 | 399 | 35.72 |
Chun-Hao Chen | 4 | 305 | 36.00 |