Theory and Principled Methods for the Design of Metaheuristics, 1st Edition

  • Published By:
  • ISBN-10: 3642332064
  • ISBN-13: 9783642332067
  • DDC: 519.6
  • Grade Level Range: College Freshman - College Senior
  • 270 Pages | eBook
  • Original Copyright 2014 | Published/Released June 2014
  • This publication's content originally published in print form: 2014

  • Price:  Sign in for price



Metaheuristics, and evolutionary algorithms in particular, are known to provide efficient, adaptable solutions for many real-world problems, but the often informal way in which they are defined and applied has led to misconceptions, and even successful applications are sometimes the outcome of trial and error. Ideally, theoretical studies should explain when and why metaheuristics work, but the challenge is huge: mathematical analysis requires significant effort even for simple scenarios and real-life problems are usually quite complex.  In this book the editors establish a bridge between theory and practice, presenting principled methods that incorporate problem knowledge in evolutionary algorithms and other metaheuristics. The book consists of 11 chapters dealing with the following topics: theoretical results that show what is not possible, an assessment of unsuccessful lines of empirical research; methods for rigorously defining the appropriate scope of problems while acknowledging the compromise between the class of problems to which a search algorithm is applied and its overall expected performance; the top-down principled design of search algorithms, in particular showing that it is possible to design algorithms that are provably good for some rigorously defined classes; and, finally, principled practice, that is reasoned and systematic approaches to setting up experiments, metaheuristic adaptation to specific problems, and setting parameters. With contributions by some of the leading researchers in this domain, this book will be of significant value to scientists, practitioners, and graduate students in the areas of evolutionary computing, metaheuristics, and computational intelligence.

Table of Contents

Front Cover.
Other Frontmatter.
Title Page.
Copyright Page.
List of Contributors.
1: No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics.
2: Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms.
3: Rugged and Elementary Landscapes.
4: Single-Funnel and Multi-Funnel Landscapes and Subthreshold-Seeking Behavior.
5: Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics.
6: Designing an Optimal Search Algorithm with Respect to Prior Information.
7: The Bayesian Search Game.
8: Principled Design of Continuous Stochastic Search: From Theory to Practice.
9: Parsimony Pressure Made Easy: Solving the Problem of Bloat in GP.
10: Experimental Analysis of Optimization Algorithms: Tuning and Beyond.
11: Formal Search Algorithms + Problem Characterisations = Executable Search Strategies.