Apress

Autonomous Search Cover Image

Autonomous combinatorial search (AS) represents a new field in combinatorial problem solving. Its major standpoint and originality is that it considers that problem solvers must be capable of self-improvement operations. This is the first book dedicated to AS.

Full Description

  • ISBN13: 978-3-6422-1433-2
  • 324 Pages
  • User Level: Science
  • Publication Date: January 5, 2012
  • Available eBook Formats: PDF
  • eBook Price: $129.00
Buy eBook Buy Print Book Add to Wishlist
Full Description
Decades of innovations in combinatorial problem solving have produced better and more complex algorithms. These new methods are better since they can solve larger problems and address new application domains. They are also more complex which means that they are hard to reproduce and often harder to fine-tune to the peculiarities of a given problem. This last point has created a paradox where efficient tools are out of reach of practitioners.Autonomous search (AS) represents a new research field defined to precisely address the above challenge. Its major strength and originality consist in the fact that problem solvers can now perform self-improvement operations based on analysis of the performances of the solving process -- including short-term reactive reconfiguration and long-term improvement through self-analysis of the performance, offline tuning and online control, and adaptive control and supervised control. Autonomous search 'crosses the chasm' and provides engineers and practitioners with systems that are able to autonomously self-tune their performance while effectively solving problems. This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms.Autonomous search (AS) represents a new research field defined to precisely address the above challenge. Its major strength and originality consist in the fact that problem solvers can now perform self-improvement operations based on analysis of the performances of the solving process -- including short-term reactive reconfiguration and long-term improvement through self-analysis of the performance, offline tuning and online control, and adaptive control and supervised control. Autonomous search 'crosses the chasm' and provides engineers and practitioners with systems that are able to autonomously self-tune their performance while effectively solving problems. This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms.This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms.This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused o
Table of Contents

Table of Contents

  1. An Introduction to Autonomous Search.
  2. Part I – Offline Configuration.
  3. Evolutionary Algorithm Parameters and Methods to Tune Them.
  4. Automated Algorithm Configuration and Parameter Tuning.
  5. Case
  6. Based Reasoning for Autonomous Constraint Solving.
  7. Learning a Mixture of Search Heuristics.
  8. Part II – Online Control.
  9. An Investigation of Reinforcement Learning for Reactive Search Optimization.
  10. Adaptive Operator Selection and Management in Evolutionary Algorithms.
  11. Parameter Adaptation in Ant Colony Optimization.
  12. Part III – New Directions and Applications.
  13. Continuous Search in Constraint Programming.
  14. Control
  15. Based Clause Sharing in Parallel SAT Solving.
  16. Learning Feature
  17. Based Heuristic Functions.
Errata

If you think that you've found an error in this book, please let us know about it. You will find any confirmed erratum below, so you can check if your concern has already been addressed.

* Required Fields

No errata are currently published