Self-Adaptive Heuristics for Evolutionary Computation

Evolutionary algorithms are successful biologically inspired meta-heuristics. Their success depends on adequate parameter settings. The question arises: how can evolutionary algorithms learn parameters automatically during the optimization? Evolution strategies gave an answer decades ago: self-adapt...

Full description

Bibliographic Details
Main Author: Kramer, Oliver (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
Series:Studies in Computational Intelligence, 147
Subjects:
Online Access:Full Text via HEAL-Link
Table of Contents:
  • I: Foundations of Evolutionary Computation
  • Evolutionary Algorithms
  • Self-Adaptation
  • II: Self-Adaptive Operators
  • Biased Mutation for Evolution Strategies
  • Self-Adaptive Inversion Mutation
  • Self-Adaptive Crossover
  • III: Constraint Handling
  • Constraint Handling Heuristics for Evolution Strategies
  • IV: Summary
  • Summary and Conclusion
  • V: Appendix
  • Continuous Benchmark Functions
  • Discrete Benchmark Functions.