Save up to 30% on Elsevier print and eBooks with free shipping. No promo code needed.
Save up to 30% on print and eBooks.
Stochastic Local Search
Foundations and Applications
1st Edition - September 16, 2004
Authors: Holger H. Hoos, Thomas Stützle
Language: English
Hardback ISBN:9781558608726
9 7 8 - 1 - 5 5 8 6 0 - 8 7 2 - 6
eBook ISBN:9780080498249
9 7 8 - 0 - 0 8 - 0 4 9 8 2 4 - 9
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…Read more
Purchase options
LIMITED OFFER
Save 50% on book bundles
Immediately download your ebook while waiting for your print delivery. No promo code is needed.
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
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
ProloguePart I. Foundations1. Introduction2. SLS Methods3. Generalized Local Search Machines4. Empirical Analysis of SLS Algorithms5. Search Space Structure and SLS PerformancePart II. Applications6. SAT and Constraint Satisfaction7. MAX-SAT and MAX-CSP8. Traveling Salesman Problems9. Scheduling Problems10. Other Combinatorial ProblemsEpilogueGlossary