This book lays the foundations for a scientific approach to tuning metaheuristics. The fundamental intuition that underlies Birattari's approach is that the tuning problem has much in common with the problems that are typically faced in machine learning.
Reactive Search and Intelligent Optimization is an excellent introduction to the main principles of reactive search, as well as an attempt to develop some fresh intuition for the approaches. The book looks at different optimization possibilities with an emphasis on opportunities for learning and self-tuning strategies. While focusing more on methods than on problems, problems are introduced wherever they help make the discussion more concrete, or when a specific problem has been widely studied by reactive search and intelligent optimization heuristics. Individual chapters cover reacting on the neighborhood; reacting on the annealing schedule; reactive prohibitions; model-based search; reacting on the objective function; relationships between reactive search and reinforcement learning; and much more. Each chapter is structured to show basic issues and algorithms; the parameters critical for the success of the different methods discussed; and opportunities for the automated tuning of these parameters.
This book lays the foundations for a scientific approach to tuning metaheuristics. The fundamental intuition that underlies Birattari's approach is that the tuning problem has much in common with the problems that are typically faced in machine learning.
Stochastic local search (SLS) algorithms are established tools for the solution of computationally hard problems arising in computer science, business adm- istration, engineering, biology, and various other disciplines. To a large extent, their success is due to their conceptual simplicity, broad applicability and high performance for many important problems studied in academia and enco- tered in real-world applications. SLS methods include a wide spectrum of te- niques, ranging from constructive search procedures and iterative improvement algorithms to more complex SLS methods, such as ant colony optimization, evolutionary computation, iterated local search, memetic algorithms, simulated annealing, tabu search, and variable neighborhood search. Historically, the development of e?ective SLS algorithms has been guided to a large extent by experience and intuition. In recent years, it has become - creasingly evident that success with SLS algorithms depends not merely on the adoption and e?cient implementation of the most appropriate SLS technique for a given problem, but also on the mastery of a more complex algorithm - gineering process. Challenges in SLS algorithm development arise partly from the complexity of the problems being tackled and in part from the many - grees of freedom researchers and practitioners encounter when developing SLS algorithms. Crucial aspects in the SLS algorithm development comprise al- rithm design, empirical analysis techniques, problem-speci?c background, and background knowledge in several key disciplines and areas, including computer science, operations research, arti?cial intelligence, and statistics.
This volume constitutes the refereed proceedings of the International Workshop on Engineering Stochastic Local Search Algorithms. Inside the volume, readers will find twelve full papers as well as nine short papers. Topics include methodological developments, behavior of SLS algorithms, search space analysis, algorithm performance, tuning procedures, AI/OR techniques, and dynamic behavior.
This will help us customize your experience to showcase the most relevant content to your age group
Please select from below
Login
Not registered?
Sign up
Already registered?
Success – Your message will goes here
We'd love to hear from you!
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.