Authors: Wegener, Ingo
Title: Theoretical Aspects of Evolutionary Algorithms
Language (ISO): en
Abstract: Randomized search heuristics like simulated annealing and evolutionary algorithms are applied successfully in many different situations. However, the theory on these algorithms is still in its infancy. Here it is discussed how and why such a theory should be developed. Afterwards, some fundamental results on evolutionary algorithms are presented in order to show how theoretical results on randomized search heuristics can be proved and how they contribute to the understanding of evolutionary algorithms.
URI: http://hdl.handle.net/2003/5410
http://dx.doi.org/10.17877/DE290R-15302
Issue Date: 2001-10-30
Publisher: Universität Dortmund
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
ci111.pdfDNB178.99 kBAdobe PDFView/Open
ci111.ps337.39 kBPostscriptView/Open


This item is protected by original copyright



All resources in the repository are protected by copyright.