Buch, Englisch, 658 Seiten
Foundations & Applications
Buch, Englisch, 658 Seiten
ISBN: 978-1-4933-0373-1
Verlag: Elsevier Science & Technology
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics.
Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the general concepts and specific instances of SLS algorithms and carefully consider their development, analysis and application. The discussion focuses on the most successful SLS methods and explores their underlying principles, properties, and features. This book gives hands-on experience with some of the most widely used search techniques, and provides readers with the necessary understanding and skills to use this powerful tool.
*Provides the first unified view of the field.
*Offers an extensive review of state-of-the-art stochastic local search algorithms and their applications.
*Presents and applies an advanced empirical methodology for analyzing the behavior of SLS algorithms.
*A companion website offers lecture slides as well as source code and Java applets for exploring and demonstrating SLS algorithms.
Zielgruppe
Academic and industry researchers in CS, AI, operations research, and Engineering (as an introduction to and/or overview of the field or as a reference text); practitioners who need to solve combinatorial problems for practical applications.
Autoren/Hrsg.
Weitere Infos & Material
Prologue
Part I. Foundations
1. Introduction
2. SLS Methods
3. Generalized Local Search Machines
4. Empirical Analysis of SLS Algorithms
5. Search Space Structure and SLS Performance
Part II. Applications
6. SAT and Constraint Satisfaction
7. MAX-SAT and MAX-CSP
8. Traveling Salesman Problems
9. Scheduling Problems
10. Other Combinatorial Problems
Epilogue
Glossary
