Theory and Principled Methods for the Design of Metaheuristics

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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Borenstein, Yossi (Editor ), Moraglio, Alberto (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2014.
Edición:1st ed. 2014.
Colección:Natural Computing Series,
Temas:
Computer science.
Computational intelligence.
Artificial intelligence.
Mathematical optimization.
Operations research.
Theory of Computation.
Computational Intelligence.
Artificial Intelligence.
Optimization.
Operations Research and Decision Theory.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics
  • Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms
  • Rugged and Elementary Landscapes
  • Single-Funnel and Multi-funnel Landscapes and Subthreshold Seeking Behavior
  • Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics
  • Designing an Optimal Search Algorithm with Respect to Prior Information
  • The Bayesian Search Game
  • Principled Design of Continuous Stochastic Search: From Theory to Practice
  • Parsimony Pressure Made Easy: Solving the Problem of Bloat in GP
  • Experimental Analysis of Optimization Algorithms: Tuning and Beyond
  • Formal Search Algorithms + Problem Characterizations = Executable Search Strategies.

Ejemplares similares