Secure CheckoutPersonal information is secured with SSL technology.
Free ShippingFree global shipping
No minimum order.
Prologue Part I. Foundations
- SLS Methods
- Generalized Local Search Machines
- Empirical Analysis of SLS Algorithms
- Search Space Structure and SLS Performance Part II. Applications
- SAT and Constraint Satisfaction
- MAX-SAT and MAX-CSP
- Traveling Salesman Problems
- Scheduling Problems
- Other Combinatorial Problems Epilogue Glossary
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
- No. of pages:
- © Morgan Kaufmann 2005
- 16th September 2004
- Morgan Kaufmann
- Hardcover ISBN:
- Paperback ISBN:
- eBook ISBN:
“The book and companion web page are well written, easy to read and suited for students, scholars, researchers and practitioners alike. We see SLS:FA as an important step towards an improved understanding of SLS methods and their behavior, and we expect that this book will inspire future researchers and spark new lines of work in this area." --Ruben Ruiz and Marco Pranzo, European Journal of Operational Research Article in Press
"Hoos and Stützle, two major players in the field, provide us with an excellent overview of stochastic local search. If you are looking for a book that covers all the major metaheuristics, gives you insight into their working, and guides you in their application to a wide set of combinatorial optimization problems, this is the book. " --Marco Dorigo, Université Libre de Bruxelles
"Stochastic Local Search: Foundations and Applications provides an original and synthetic presentation of a large class of algorithms more commonly known as metaheuristics. Over the last 20 years, these methods have become extremely popular, often representing the only practical approach for tackling so many of the hard combinatorial problems that are encountered in real-life applications. Hoos and Stützle’s treatment of the topic is comprehensive and covers a variety of techniques, including simulated annealing, tabu search, genetic algorithms and ant colony optimization, but a main feature of the book is its proposal of a most welcome unifying framework for describing and analyzing the various methods." --Michel Gendreau, Université de Montréal
"Local search algorithms are often the most practical approach to solving constraint satisfaction and optimization problems that admit no fast deterministic solution. This book is full of information and insights that would be invaluable for both researchers and practitioners." --Henry Kautz, University of Washington
"This extensive book provides an authoritative and detailed exposition for novices and experts alike who need to tackle difficult decision or combinatorial optimization problems. The chapters span fundamental theoretical questions such as, “When and why do heuristics work well?” but also more applied aspects involving, for instance, the comparison of very different algorithms. The authors are university faculty members and leading players in their research fields; our communities will enjoy in particular their books’ valuable teaching material and a “complete” bibliography of the state of the art for the field." --Olivier Martin, Université Paris-Sud, Orsay
"The authors provide a lucid and comprehensive introduction to the large body of work on stochastic local search methods for solving combinatorial problems. The text also covers a series of carefully executed empirical studies that provide significant further insights into the performance of such methods and show the value of an empirical scientific methodology in the study of algorithms. An excellent overview of the wide range of applications of stochastic local search methods is included." --Bart Selman, Cornell University
"Stochastic local search is a powerful search technique for solving a wide range of combinatorial problems. If you only want to read one book on this important topic, you should read Hoos and Stützle’s. It is a comprehensive and informative survey of the field that will equip you with the tools and understanding to use stochastic local search to solve the problems you come across." --Toby Walsh, Cork Constraint Computation Centre, University College Cork
"This book provides remarkable coverage and synthesis of the recent explosion of work on randomized local search algorithms. It will serve as a good textbook for classes on heuristic search and metaheuristics as well as a central reference for researchers. The book provides a unification of a broad spectrum of methods that enables concise, highly readable descriptions of theoretical and experimental results." --David L. Woodruff, University of California, Davis
“One of the nice features of this book is that it puts some considered metaheuristics into broader perspective. The book provides a comprehensive treatment of stochastic local search. It will serve as an entry point for this field for quite some time." --Stefan Voss, University of Hamburg, Hamburg, Germany
"The book establishes a landmark in the broad field of this type of algorithms that are also known as metaheuristics. This book is the first in unifying the dispersed field of Stochastic Local Search (SLS) algorithms. Written in a clear and easy-to-read style, the book tries to cover all possible audiences, from graduate students or doctoral students to practitioners and researchers. The book more than accomplishes its main goal of covering both the foundations and the many applications of SLS algorithms. It provides an excellent empirical scientific methodology geared towards the successful application of SLS algorithms in practice. Furthermore, it presents advances in the explanation of complex SLS behavior, something which is much needed and refreshingly new in the field.
The book and companion web page are well written, easy to read and suited for students, scholars, researchers and practitioners alike." --European Journal of Operational Research
The University of British Columbia, Canada
Darmstadt University of Technology, Germany
Elsevier.com visitor survey
We are always looking for ways to improve customer experience on Elsevier.com.
We would like to ask you for a moment of your time to fill in a short questionnaire, at the end of your visit.
If you decide to participate, a new browser tab will open so you can complete the survey after you have completed your visit to this website.
Thanks in advance for your time.