Particle swarm and population structure

Carlos M. Fernandes, Agostinho C. Rosa, Nuno Fachada, Juan L. J. Laredo, J. J. Merelo

Research output: Contribution to conferencePaper

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 languageEnglish
DOIs
Publication statusPublished - 2018
EventACM -
Duration: 17 Nov 2022 → …

Conference

ConferenceACM
Period17/11/22 → …

Bibliographical note

GECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference Companion

Keywords

  • PARTICLE SWARM OPTIMIZATION
  • POPULATION

Fingerprint

Dive into the research topics of 'Particle swarm and population structure'. Together they form a unique fingerprint.

Cite this