@techreport{BartzBeielsteinBrankeMehnenetal.2015, author = {Thomas Bartz-Beielstein and J{\"u}rgen Branke and J{\"o}rn Mehnen and Olaf Mersmann}, title = {Overview: Evolutionary Algorithms}, url = {https://nbn-resolving.org/urn:nbn:de:hbz:832-cos-777}, year = {2015}, abstract = {Evolutionary algorithm (EA) is an umbrella term used to describe population-based stochastic direct search algorithms that in some sense mimic natural evolution. Prominent representatives of such algorithms are genetic algorithms, evolution strategies, evolutionary programming, and genetic programming. On the basis of the evolutionary cycle, similarities and differences between these algorithms are described. We briefly discuss how EAs can be adapted to work well in case of multiple objectives, and dynamic or noisy optimization problems. We look at the tuning of algorithms and present some recent developments coming from theory. Finally, typical applications of EAs to real-world problems are shown, with special emphasis on data-mining applications}, language = {de} }