Relation of neighborhood size and diversity loss rate in particle swarm optimization with ring topology

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F21%3A63544498" target="_blank" >RIV/70883521:28140/21:63544498 - isvavai.cz</a>

Výsledek na webu

<a href="https://mendel-journal.org/index.php/mendel/article/view/151/162" target="_blank" >https://mendel-journal.org/index.php/mendel/article/view/151/162</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.13164/mendel.2021.2.074" target="_blank" >10.13164/mendel.2021.2.074</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Relation of neighborhood size and diversity loss rate in particle swarm optimization with ring topology

Popis výsledku v původním jazyce

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. © 2021, Brno University of Technology. All rights reserved.

Název v anglickém jazyce

Relation of neighborhood size and diversity loss rate in particle swarm optimization with ring topology

Popis výsledku anglicky

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. © 2021, Brno University of Technology. All rights reserved.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Mendel

ISSN

1803-3814

e-ISSN

—

Svazek periodika

27

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

6

Strana od-do

74-79

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85123621688