Impact of chaotic dynamics on the performance of metaheuristic optimization algorithms: An experimental analysis
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F22%3A10248763" target="_blank" >RIV/61989100:27740/22:10248763 - isvavai.cz</a>
Nalezeny alternativní kódy
RIV/61989100:27240/22:10248763
Výsledek na webu
<a href="https://www.sciencedirect.com/science/article/pii/S0020025521011002" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0020025521011002</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ins.2021.10.076" target="_blank" >10.1016/j.ins.2021.10.076</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Impact of chaotic dynamics on the performance of metaheuristic optimization algorithms: An experimental analysis
Popis výsledku v původním jazyce
Random mechanisms including mutations are an internal part of evolutionary algorithms, which are based on the fundamental ideas of Darwin's theory of evolution as well as Mendel's theory of genetic heritage. In this paper, we debate whether pseudo-random processes are needed for evolutionary algorithms or whether deterministic chaos, which is not a random process, can be suitably used instead. Specifically, we compare the performance of 10 evolutionary algorithms driven by chaotic dynamics and pseudo-random number generators using chaotic processes as a comparative study. In this study, the logistic equation is employed for generating periodical sequences of different lengths, which are used in evolutionary algorithms instead of randomness. We suggest that, instead of pseudo-random number generators, a specific class of deterministic processes (based on deterministic chaos) can be used to improve the performance of evolutionary algorithms. Finally, based on our findings, we propose new research questions. (C) 2021 The Author(s)
Název v anglickém jazyce
Impact of chaotic dynamics on the performance of metaheuristic optimization algorithms: An experimental analysis
Popis výsledku anglicky
Random mechanisms including mutations are an internal part of evolutionary algorithms, which are based on the fundamental ideas of Darwin's theory of evolution as well as Mendel's theory of genetic heritage. In this paper, we debate whether pseudo-random processes are needed for evolutionary algorithms or whether deterministic chaos, which is not a random process, can be suitably used instead. Specifically, we compare the performance of 10 evolutionary algorithms driven by chaotic dynamics and pseudo-random number generators using chaotic processes as a comparative study. In this study, the logistic equation is employed for generating periodical sequences of different lengths, which are used in evolutionary algorithms instead of randomness. We suggest that, instead of pseudo-random number generators, a specific class of deterministic processes (based on deterministic chaos) can be used to improve the performance of evolutionary algorithms. Finally, based on our findings, we propose new research questions. (C) 2021 The Author(s)
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10200 - Computer and information sciences
Návaznosti výsledku
Projekt
<a href="/cs/project/VJ01010008" target="_blank" >VJ01010008: Kybernetická bezpečnost sítí v postkvantové éře</a><br>
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2022
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ů
Údaje specifické pro druh výsledku
Název periodika
Information sciences
ISSN
0020-0255
e-ISSN
—
Svazek periodika
587
Číslo periodika v rámci svazku
1
Stát vydavatele periodika
US - Spojené státy americké
Počet stran výsledku
27
Strana od-do
"692 "- 719
Kód UT WoS článku
000796869000020
EID výsledku v databázi Scopus
2-s2.0-85119922430