Shop the Archives and get your next eBook for just 14.99! Stock up today >>

Theoretical Computer Science and General Issues

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics

International Workshop, SLS 2009, Brussels, Belgium, September 3-5, 2009, Proceedings

Editors: Stützle, Thomas, Birattari, Mauro, Hoos, Holger H. (Eds.)

Buy this book

eBook $64.99
price for USA in USD (gross)
  • ISBN 978-3-642-03751-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $84.99
price for USA in USD
  • ISBN 978-3-642-03750-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (17 chapters)

  • High-Performance Local Search for Task Scheduling with Human Resource Allocation

    Estellon, Bertrand (et al.)

    Pages 1-15

  • On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms

    Ribeiro, Celso C. (et al.)

    Pages 16-30

  • Estimating Bounds on Expected Plateau Size in MAXSAT Problems

    Sutton, Andrew M. (et al.)

    Pages 31-45

  • A Theoretical Analysis of the k-Satisfiability Search Space

    Sutton, Andrew M. (et al.)

    Pages 46-60

  • Loopy Substructural Local Search for the Bayesian Optimization Algorithm

    Lima, Claudio F. (et al.)

    Pages 61-75

Buy this book

eBook $64.99
price for USA in USD (gross)
  • ISBN 978-3-642-03751-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $84.99
price for USA in USD
  • ISBN 978-3-642-03750-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Book Subtitle
International Workshop, SLS 2009, Brussels, Belgium, September 3-5, 2009, Proceedings
Editors
  • Thomas Stützle
  • Mauro Birattari
  • Holger H. Hoos
Series Title
Theoretical Computer Science and General Issues
Series Volume
5752
Copyright
2009
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-03751-1
DOI
10.1007/978-3-642-03751-1
Softcover ISBN
978-3-642-03750-4
Edition Number
1
Number of Pages
X, 155
Topics