Funded by the European Union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Education and Culture Executive Agency (EACEA). Neither the European Union nor EACEA can be held responsible for them.

Algorithms

Local Search

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

Scientific Area:
C++, Python

Language/Environments:
Learning, Optimization

Target Group:
Basic


Cite as:
Hoos, H. H., & St├╝tzle, T. (2004). Stochastic local search: Foundations and applications. Elsevier.

Author of the review:
Ivo Nowak
HAW Hamburg


Reviews

You have to login to leave a comment. If you are not registered click here