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”

Self-Organizing Migrating Algorithm for Dynamic Problems: An Experimental study

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F07%3APU70838" target="_blank" >RIV/00216305:26230/07:PU70838 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Self-Organizing Migrating Algorithm for Dynamic Problems: An Experimental study

  • Original language description

    This paper is an experimental study investigating the capability of well known Self-Organizing Migrating Algorithm (SOMA) to solve dynamic problems. We have proposed a new extension of SOMA algorithm with two new approaches based on multi-population andelite concept. We tested the performance of the algorithm on the artificial benchmark with moving peaks. The experimental results confirmed the capability of the proposed dynamic xSODOMA algorithm to effectively adapt the search process towards the nonstationary global optimum.

  • Czech name

    Self-Organizing Migrating Algorithm for Dynamic Problems: An EXperimental study

  • Czech description

    This paper is an experimental study investigating the capability of well known Self-Organizing Migrating Algorithm (SOMA) to solve dynamic problems. We have proposed a new extension of SOMA algorithm with two new approaches based on multi-population andelite concept. We tested the performance of the algorithm on the artificial benchmark with moving peaks. The experimental results confirmed the capability of the proposed dynamic xSODOMA algorithm to effectively adapt the search process towards the nonstationary global optimum.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA102%2F07%2F0850" target="_blank" >GA102/07/0850: Design and hardware implementation of a patent-invention machine</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2007

  • 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

    13th International Conference on Soft Computing

  • ISBN

    978-80-214-3473-8

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    24-29

  • Publisher name

    Faculty of Mechanical Engineering BUT

  • Place of publication

    Brno

  • Event location

    FME, VUT BRNO

  • Event date

    May 30, 2006

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article