Theory and Principled Methods for the Design of Metaheuristics

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Borenstein, Yossi (Επιμελητής έκδοσης), Moraglio, Alberto (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2014.
• Σειρά: Natural Computing Series,
• Θέματα: Computer science.; Operations research.; Decision making.; Computers.; Artificial intelligence.; Mathematical optimization.; Computational intelligence.; Computer Science.; Theory of Computation.; Computational Intelligence.; Artificial Intelligence (incl. Robotics).; Optimization.; Operation Research/Decision Theory.

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

Πίνακας περιεχομένων:

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