Name
Abstract | ||
|---|---|---|
The basic particle swarm optimisation PSO algorithm is easily trapped in local optima. To deal with this problem, a multi-subpopulation cooperative particle swarm optimisation MCPSO is presented. In the proposed algorithm, the particles are divided into several normal subpopulations and an elite subpopulation. The selected individuals in normal subpopulation are memorised into the elite subpopulation, and some individuals in normal subpopulation are replaced by the best particles from the elite subpopulation. Different subpopulation adopts different evolution model. This strategy can maintain the diversity of the population and avoid the premature convergence. The performance of the proposed algorithm is evaluated by testing on standard benchmark functions. The experimental results show that the proposed algorithm has better convergent rate and high solution accuracy. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1504/IJCSM.2015.067538 | International Journal of Computing Science and Mathematics |
Keywords | Field | DocType |
particle swarm optimisation, PSO, premature convergence, multi-subpopulation, elite particle, mutation operator, diversity | Particle swarm optimization,Population,Mathematical optimization,Premature convergence,Computer science,Local optimum,Mutation operator | Journal |
Volume | Issue | ISSN |
6 | 1 | 1752-5055 |
Citations | PageRank | References |
1 | 0.37 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guohan Lin | 1 | 14 | 2.24 |
| Jing Zhang | 2 | 40 | 7.49 |