Abstract
We investigate the convergence speed, accuracy, robustness and scalability of PSOs structured by regular and random graphs with 3 ≤ k ≤ n. The main conclusion is that regular and random graphs with the same averaged connectivity k may result in significantly different performance, namely when k is low.
Original language | English |
---|---|
DOIs | |
Publication status | Published - 2018 |
Event | ACM - Duration: 17 Nov 2022 → … |
Conference
Conference | ACM |
---|---|
Period | 17/11/22 → … |
Bibliographical note
GECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference CompanionKeywords
- PARTICLE SWARM OPTIMIZATION
- POPULATION