Local Search is a heuristic method for solving computationally hard optimization problems. Local search can be used on problems that can be formulated as finding a solution maximizing a criterion among a number of candidate solutions. Local search algorithms move from solution to solution in the space of candidate solutions (the search space) by applying local changes, until a solution deemed optimal is found or a time bound is elapsed. Local search algorithms are widely applied to numerous hard computational problems, including problems from computer science (particularly artificial intelligence), mathematics, operations research, engineering, and bioinformatics

https://machinelearningmastery.com/iterated-local-search-from-scratch-in-python/
https://en.wikipedia.org/wiki/Local_search_(optimization )
https://www.sciencedirect.com/book/9781558608726/stochastic-local-search

Hoos, H. H., & Stützle, T. (2004). Stochastic local search: Foundations and applications. Elsevier.

Ivo Nowak

HAW Hamburg