Number of the records: 1  

Evolutionary Algorithms and Chaotic Systems

  1. 1.
    SYSNO ASEP0340465
    Document TypeM - Monograph Chapter
    R&D Document TypeMonograph Chapter
    TitleChaos Synthesis by Evolutionary Algorithms
    Author(s) Zelinka, I. (CZ)
    Chen, G. (CN)
    Čelikovský, Sergej (UTIA-B) RID, ORCID
    Source TitleEvolutionary Algorithms and Chaotic Systems. - Berlin : Springer-Verlag, 2010 / Zelinka I. ; Čelikovský S. ; Richter H. ; Chen G. - ISSN 1860-949X - ISBN 978-3-642-10706-1
    Pagess. 345-382
    Number of pages38 s.
    Number of copy201
    Number of pages521
    Languageeng - English
    CountryDE - Germany
    Keywordschaos synthesis ; evolutionary algorithms ; self organizingmigrating ; evolutionary computing
    Subject RIVBC - Control Systems Theory
    CEZAV0Z10750506 - UTIA-B (2005-2011)
    UT WOS000275281800011
    DOI10.1007/978-3-642-10707-8
    AnnotationThis chapter introduces the notion of chaos synthesis by means of evolutionary algorithms and develops a new method for chaotic systems synthesis. This method is similar to genetic programming and grammatical evolution and is applied alongside evolutionary algorithms: differential evolution, self organizingmigrating, genetic algorithm, simulated annealing and evolutionary strategies. The aim of this investigation is to synthesize new and “simple” chaotic systems based on some elements contained in a pre-chosen existing chaotic system and a properly defined cost function. The investigation consists of two case studies based on the aforementioned evolutionary algorithms in various versions. For all algorithms, 100 simulations of chaos synthesis were repeated and then averaged to guarantee the reliability and robustness of the proposed method. The most significant results are carefully selected, visualized and commented in this chapter.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2010
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.