0340465 20240111140737.120100310235959.9 000275281800011 10.1007/978-3-642-10707-8 38 s. 521 cav_un_epca*0340151978-3-642-10706-11860-949X345-382BerlinSpringer-Verlag2010ZelinkaI.ČelikovskýS.RichterH.ChenG. chaos synthesis evolutionary algorithms self organizingmigrating evolutionary computing cav_un_auth*0237374 Zelinka I. CZ cav_un_auth*0243483 Chen G. CN cav_un_auth*0101074 Čelikovský Sergej Teorie řízení Department of Control Theory TŘ TR UTIA-B Department of Control Theory Ústav teorie informace a automatizace AV ČR, v. v. i. pdf soubor CEZ:AV0Z10750506 This 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. 2010 BC http://hdl.handle.net/11104/0183688 2010 000275281800011 WOS pdf soubor cav_un_epca*0340151 Evolutionary Algorithms and Chaotic Systems 978-3-642-10706-1 1860-949X 345 382 Berlin Springer-Verlag 2010 Studies in Computational Intelligence 267 Zelinka I. 340 Čelikovský S. 340 Richter H. 340 Chen G. 340