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”

Ensemble of strategies and perturbation parameter based SOMA for optimal stabilization of chaotic oscillations

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F20%3A63527058" target="_blank" >RIV/70883521:28140/20:63527058 - isvavai.cz</a>

  • Result on the web

    <a href="https://dl.acm.org/doi/10.1145/3377929.3398145" target="_blank" >https://dl.acm.org/doi/10.1145/3377929.3398145</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/3377929.3398145" target="_blank" >10.1145/3377929.3398145</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Ensemble of strategies and perturbation parameter based SOMA for optimal stabilization of chaotic oscillations

  • Original language description

    In this paper, we are investigating an original ensemble based adaptive strategy for the Self Organizing Migrating Algorithm (SOMA), namely the &quot;Ensemble of Strategies and Perturbation Parameter in SOMA&quot; (ESP-SOMA). The algorithm to which the main attention is focused as well as other state of the art metaheuristic algorithm (SHADE) are utilized in the complex task of time and quality optimal stabilization of chaotic system oscillations. Since there is a growing demand for intelligent and fast problem solutions in engineering, this paper represents an insight into the applicability and effectivity of modern adaptive/state of the art metaheuristic optimization algorithms in the task of constrained and difficult optimization problem. Experiments encompass two different cases of desired behaviour of chaotic system, and two different designs of objective function in terms of complexity. The simple statistical comparison of the results given by four different metaheuristic algorithms is also reported here for the pairs of generic and enhanced versions.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • 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

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2020

  • 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

  • Article name in the collection

    GECCO 2020 Companion - Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion

  • ISBN

    978-145037127-8

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    1468-1475

  • Publisher name

    Association for Computing Machinery

  • Place of publication

    New York

  • Event location

    Cancun

  • Event date

    Jul 8, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article