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”

Impact of chaotic dynamics on the performance of metaheuristic optimization algorithms: An experimental analysis

The result's identifiers

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

  • Alternative codes found

    RIV/61989100:27240/22:10248763

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Impact of chaotic dynamics on the performance of metaheuristic optimization algorithms: An experimental analysis

  • Original language description

    Random mechanisms including mutations are an internal part of evolutionary algorithms, which are based on the fundamental ideas of Darwin&apos;s theory of evolution as well as Mendel&apos;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)

  • 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

    10200 - Computer and information sciences

Result continuities

  • Project

    <a href="/en/project/VJ01010008" target="_blank" >VJ01010008: Network Cybersecurity in Post-Quantum Era</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2022

  • 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

    Information sciences

  • ISSN

    0020-0255

  • e-ISSN

  • Volume of the periodical

    587

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    27

  • Pages from-to

    "692 "- 719

  • UT code for WoS article

    000796869000020

  • EID of the result in the Scopus database

    2-s2.0-85119922430