Natural Computing Series

Analyzing Evolutionary Algorithms

The Computer Science Perspective

Authors: Jansen, Thomas

  • The results presented are derived in detail
  • A useful reference for both graduate students and researchers
  • Each chapter ends with detailed comments and pointers to further reading
see more benefits

Buy this book

eBook $79.99
price for USA
  • ISBN 978-3-642-17339-4
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $109.00
price for USA
  • ISBN 978-3-642-17338-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $109.00
price for USA
  • ISBN 978-3-642-43601-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this Textbook

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.

 

About the authors

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.

 

Reviews

From the book reviews:

“This book focuses on the theoretical analysis of evolutionary algorithms as one of the randomized algorithms in computer science. … This book serves as a very useful source for researchers who are interested in exploring these challenging topics. … I highly recommend it for anyone who is looking to explore both the theoretical aspects of evolutionary algorithms and the practical aspects of designing more efficient algorithms.” (R. Qu, Interfaces, Vol. 44 (4), July-August, 2014)

“‘Analyzing evolutionary algorithms’ is a beautiful book that has a lot to offer to people with different backgrounds. It not only explains evolutionary algorithms and puts them into relationship with other randomized search algorithms, it also provides detailed information for specialists who want to understand in depth how, why, and when evolutionary algorithms work. … The book is complemented by an extended list of references and suggestions for further reading.” (Manfred Kerber, zbMATH, Vol. 1282, 2014)

“This textbook provides a self-contained introduction into this exciting research subject. It can be used as a course text for advanced undergraduate or graduate levels, and it is at the same time a much welcome reference book for active researchers in this area. … Each chapter is therefore complemented by a remarks section that briefly summarizes the advances in the respective topics. In many cases pointers are given to recent research reports.” (Carola Doerr, Mathematical Reviews, October, 2013)

“Analyzing Evolutionary Algorithms is aimed at evolutionary computation researchers and enthusiasts who are interested in the theoretical analysis of evolutionary algorithms. It will be accessible to post-graduates and advanced undergraduates in mathematics and/or computer science, and generally anyone with a working background in discrete mathematics, algorithms, and basic probability theory. Theoreticians will benefit from this book because it works well as a convenient reference for essential analytical strategies and many up-to-date results.” (Andrew M. Sutton, Genetic Programming and Evolvable Machines, Vol. 14, 2013)


Table of contents (6 chapters)

  • Introduction

    Jansen, Thomas

    Pages 1-6

  • Evolutionary Algorithms and Other Randomized Search Heuristics

    Jansen, Thomas

    Pages 7-29

  • Theoretical Perspectives on Evolutionary Algorithms

    Jansen, Thomas

    Pages 31-44

  • General Limits in Black-Box Optimization

    Jansen, Thomas

    Pages 45-84

  • Methods for the Analysis of Evolutionary Algorithms

    Jansen, Thomas

    Pages 85-155

Buy this book

eBook $79.99
price for USA
  • ISBN 978-3-642-17339-4
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $109.00
price for USA
  • ISBN 978-3-642-17338-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $109.00
price for USA
  • ISBN 978-3-642-43601-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Bibliographic Information

Bibliographic Information
Book Title
Analyzing Evolutionary Algorithms
Book Subtitle
The Computer Science Perspective
Authors
Series Title
Natural Computing Series
Copyright
2013
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-17339-4
DOI
10.1007/978-3-642-17339-4
Hardcover ISBN
978-3-642-17338-7
Softcover ISBN
978-3-642-43601-7
Series ISSN
1619-7127
Edition Number
1
Number of Pages
X, 258
Topics