Evolutionary Algorithms for Chaos Researchers
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86075792" target="_blank" >RIV/61989100:27240/10:86075792 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Evolutionary Algorithms for Chaos Researchers
Original language description
Evolutionary algorithms are search methods that can be used for solving optimization problems. They mimic working principles from natural evolution by employing a population-based approach, labeling each individual of the popula- tion with a fitness andincluding elements of random, albeit the random is directed through a selection process. In this chapter, we review the basic principles of evo- lutionary algorithms and discuss their purpose, structure and behavior. In doing so, it is particularly shownhow the fundamental understanding of natural evolution processes has cleared the ground for the origin of evolutionary algorithms. Major implementation variants and their structural as well as functional elements are discussed. We also give a brief overview on usability areas of the algorithm and end with some general remarks of the limits of computing.
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
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
Book/collection name
Evolutionary Algorithms and Chaotic Systems
ISBN
978-3-642-10706-1
Number of pages of the result
52
Pages from-to
—
Number of pages of the book
523
Publisher name
Springer-Verlag
Place of publication
Heidelberg
UT code for WoS chapter
—