Investigation on evolutionary algorithms powered by nonrandom processes

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F18%3A63520699" target="_blank" >RIV/70883521:28140/18:63520699 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/70883521:28140/16:43875578 RIV/61989100:27240/16:86100246

Výsledek na webu

<a href="https://link.springer.com/article/10.1007/s00500-015-1689-2" target="_blank" >https://link.springer.com/article/10.1007/s00500-015-1689-2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s00500-015-1689-2" target="_blank" >10.1007/s00500-015-1689-2</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Investigation on evolutionary algorithms powered by nonrandom processes

Popis výsledku v původním jazyce

Inherent part of evolutionary algorithms that are based on Darwin’s theory of evolution and Mendel’s theory of genetic heritage, are random processes since genetic algorithms and evolutionary strategies are used. In this paper, we present extended experiments (of our previous) of selected evolutionary algorithms and test functions showing whether random processes really are needed in evolutionary algorithms. In our experiments we used differential evolution and SOMA algorithms with functions 2ndDeJong, Ackley, Griewangk, Rastrigin, SineWave and StretchedSineWave. We use n periodical deterministic processes (based on deterministic chaos principles) instead of pseudo-random number generators (PRGNs) and compare performance of evolutionary algorithms powered by those processes and by PRGNs. Results presented here are numerical demonstrations rather than mathematical proofs. We propose the hypothesis that a certain class of deterministic processes can be used instead of PRGNs without lowering the performance of evolutionary algorithms.

Název v anglickém jazyce

Investigation on evolutionary algorithms powered by nonrandom processes

Popis výsledku anglicky

Inherent part of evolutionary algorithms that are based on Darwin’s theory of evolution and Mendel’s theory of genetic heritage, are random processes since genetic algorithms and evolutionary strategies are used. In this paper, we present extended experiments (of our previous) of selected evolutionary algorithms and test functions showing whether random processes really are needed in evolutionary algorithms. In our experiments we used differential evolution and SOMA algorithms with functions 2ndDeJong, Ackley, Griewangk, Rastrigin, SineWave and StretchedSineWave. We use n periodical deterministic processes (based on deterministic chaos principles) instead of pseudo-random number generators (PRGNs) and compare performance of evolutionary algorithms powered by those processes and by PRGNs. Results presented here are numerical demonstrations rather than mathematical proofs. We propose the hypothesis that a certain class of deterministic processes can be used instead of PRGNs without lowering the performance of evolutionary algorithms.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

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

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2018

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

Soft computing

ISSN

1432-7643

e-ISSN

—

Svazek periodika

22

Číslo periodika v rámci svazku

6

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

11

Strana od-do

1791-1801

Kód UT WoS článku

000426761200006

EID výsledku v databázi Scopus

2-s2.0-84929105004