Name
Abstract | ||
|---|---|---|
In this paper, a novel particle swarm optimization (PSO) algorithm is put forward where a sigmoid-function-based weighting strategy is developed to adaptively adjust the acceleration coefficients. The newly proposed adaptive weighting strategy takes into account both the distances from the particle to the global best position and from the particle to its personal best position, thereby having the distinguishing feature of enhancing the convergence rate. Inspired by the activation function of neural networks, the new strategy is employed to update the acceleration coefficients by using the sigmoid function. The search capability of the developed adaptive weighting PSO (AWPSO) algorithm is comprehensively evaluated via eight well-known benchmark functions including both the unimodal and multimodal cases. The experimental results demonstrate that the designed AWPSO algorithm substantially improves the convergence rate of the particle swarm optimizer and also outperforms some currently popular PSO algorithms. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/TCYB.2019.2925015 | IEEE Transactions on Cybernetics |
Keywords | DocType | Volume |
Acceleration coefficients,adaptive weighting,convergence rate,evolutionary computation,particle swarm optimization (PSO) | Journal | 51 |
Issue | ISSN | Citations |
2 | 2168-2267 | 6 |
PageRank | References | Authors |
0.40 | 16 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weibo Liu | 1 | 520 | 16.88 |
| Zidong Wang | 2 | 11003 | 578.11 |
| Yuan Yuan | 3 | 228 | 35.28 |
| Nianyin Zeng | 4 | 384 | 12.14 |
| Kate Hone | 5 | 87 | 7.23 |
| Xiaohui Liu | 6 | 5042 | 269.99 |