Analyzing Evolutionary Algorithms

Thomas Jansen

ISBN 10: 3642173381 / ISBN 13: 9783642173387

Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2012, 2012

Riguardo questo articolo

Neuware -Evolutionary algorithms is a class of randomized heuristics inspired by natural evolution. They are applied in many different contexts, in particular in optimization, and analysis of such algorithms has seen tremendous advances in recent years.In this book the author provides an introduction to the methods used to analyze evolutionary algorithms and other randomized search heuristics. He starts with an algorithmic and modular perspective and gives guidelines for the design of evolutionary algorithms. He then places the approach in the broader research context with a chapter on theoretical perspectives. By adopting a complexity-theoretical perspective, he derives general limitations for black-box optimization, yielding lower bounds on the performance of evolutionary algorithms, and then develops general methods for deriving upper and lower bounds step by step. This main part is followed by a chapter covering practical applications of these methods.The notational and mathematical basics are covered in an appendix, the results presented are derived in detail, and each chapter ends with detailed comments and pointers to further reading. So the book is a useful reference for both graduate students and researchers engaged with the theoretical analysis of such algorithms.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 268 pp. Englisch.

Codice articolo 9783642173387

Dati bibliografici

• Titolo: Analyzing Evolutionary Algorithms
• Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2012
• Data di pubblicazione: 2012
• Lingua: Inglese
• ISBN 10: 3642173381
• ISBN 13: 9783642173387
• Rilegatura: Buch
• Condizione: Neu
• Dimensioni: 241 L x 160 A x 20 P (millimetri) 241 millimetri di larghezza per 160 millimetri di altezza per 20 millimetri di profondità
• Peso: 571 grammi

Descrizione articolo

Riassunto

Evolutionary algorithms is a class of randomized heuristics inspired by natural evolution. They are applied in many different contexts, in particular in optimization, and analysis of such algorithms has seen tremendous advances in recent years.

In this book the author provides an introduction to the methods used to analyze evolutionary algorithms and other randomized search heuristics. He starts with an algorithmic and modular perspective and gives guidelines for the design of evolutionary algorithms. He then places the approach in the broader research context with a chapter on theoretical perspectives. By adopting a complexity-theoretical perspective, he derives general limitations for black-box optimization, yielding lower bounds on the performance of evolutionary algorithms, and then develops general methods for deriving upper and lower bounds step by step. This main part is followed by a chapter covering practical applications of these methods.

The notational and mathematical basics are covered in an appendix, the results presented are derived in detail, and each chapter ends with detailed comments and pointers to further reading. So the book is a useful reference for both graduate students and researchers engaged with the theoretical analysis of such algorithms.

Informazioni sull?autore

The author lectured and researched in the Technische Universität Dortmund for 9 years after his PhD, and he is now the Stokes College Lecturer in the Department of Computer Science in University College Cork. He has tested the book content in his own lectures at these universities, and he has been invited to run the tutorial on this subject at the main international conference on evolutionary computing, GECCO.