Theory and Principled Methods for the Design of Metaheuristics
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783662519554
- ISBN-10: 3662519550
- Publisher: Springer
- Publish Date: August 2016
- Dimensions: 9.21 x 6.14 x 0.61 inches
- Shipping Weight: 0.91 pounds
- Page Count: 270
Related Categories
