Relation of Neighborhood Size and Diversity Loss Rate in Particle Swarm Optimization With Ring Topology

Loading...
Thumbnail Image
Date
2021-12-21
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Automation and Computer Science, Brno University of Technology
Altmetrics
Abstract
Measuring the population diversity in metaheuristics has become a common practice for adaptive approaches, aiming mainly to address the issue of premature convergence. Understanding the processes leading to a diversity loss in a metaheuristic algorithm is crucial for designing successful adaptive approaches. In this study, we focus on the relation of the neighborhood size and the rate of diversity loss in the Particle Swarm Optimization algorithm with local topology (also known as LPSO). We argue that the neighborhood size is an important input to consider when designing any adaptive approach based on the change of population diversity. We used the extensive benchmark suite of the IEEE CEC 2014 competition for experiments.
Description
Citation
Mendel. 2021 vol. 27, č. 2, s. 74-79. ISSN 1803-3814
https://mendel-journal.org/index.php/mendel/article/view/151
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en
Study field
Comittee
Date of acceptance
Defence
Result of defence
Document licence
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International license
http://creativecommons.org/licenses/by-nc-sa/4.0
Collections
Citace PRO