Stochastic Local Search

Authored by: Holger H. Hoos , Thomas Stϋtzle

Handbook of Approximation Algorithms and Metaheuristics, Second Edition

Print publication date:  May  2018
Online publication date:  May  2018

Print ISBN: 9781498770118
eBook ISBN: 9781351236423
Adobe ISBN:

10.1201/9781351236423-17

 Download Chapter

 

Abstract

Stochastic local search (SLS) algorithms are among the most successful techniques for solving computationally hard problems from computing science, operations research and various application areas; examples range from propositional satisfiability, routing- and scheduling problems to genome sequence assembly, protein structure prediction and winner determination in combinatorial auctions. Because of their versatility and excellent performance in combination with the fact that efficient implementations can often be achieved relatively easily, SLS methods enjoy an ever-increasing popularity among researchers and practitioners.

 Cite
Search for more...
Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.