Particle swarm and population structure

Agostinho C. Rosa, Nuno Fachada, Juan L. J. Laredo, J. J. Merelo, Carlos Miguel da Costa Fernandes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)
1 Downloads (Pure)

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
Title of host publicationGECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion
PublisherAssociation for Computing Machinery, Inc
Pages85-86
Number of pages2
ISBN (Electronic)9781450357647
DOIs
Publication statusPublished - 6 Jul 2018
Event2018 Genetic and Evolutionary Computation Conference, GECCO 2018 - Kyoto, Japan
Duration: 15 Jul 201819 Jul 2018

Publication series

NameGECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion

Conference

Conference2018 Genetic and Evolutionary Computation Conference, GECCO 2018
Country/TerritoryJapan
CityKyoto
Period15/07/1819/07/18

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