Particle swarm and population structure

Carlos M. C. Fernandes, Agostinho C. Rosa, Nuno Fachada, Juan Luís Jiménez Laredo, Juan Julián Merelo · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2018

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.

Read the paper · More papers on PaperTik