All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Investigation on evolutionary algorithms powered by nonrandom processes

The result's identifiers

  • Result code in 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>

  • Alternative codes found

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

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Investigation on evolutionary algorithms powered by nonrandom processes

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2018

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Soft computing

  • ISSN

    1432-7643

  • e-ISSN

  • Volume of the periodical

    22

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    11

  • Pages from-to

    1791-1801

  • UT code for WoS article

    000426761200006

  • EID of the result in the Scopus database

    2-s2.0-84929105004