In computer science, local search is a heuristic method for solving computationally difficult optimization problems. Local search can be used in problems that. Examples · Description · See also In computer science, local search is a heuristic method for solving computationally difficult optimization problems. Local search can be used in problems that can be formulated such as finding a solution by maximizing a criterion among several candidate solutions.
Local search algorithms move from one solution to another in the candidate solution space (the search space) applying local changes, until a solution is found that is considered optimal or until a time limit has elapsed. Below, we list several specific heuristics to improve local search, with the main objective of escaping local lows. Because the local search depends on the initial solution, there is a high chance of getting stuck in a local optimum. Usually, moving from one state to another involves only a local change in the value of a single variable, hence the local search name.
The local search algorithm explores and evaluates different solutions (search space) by applying local changes until an optimal solution is achieved or certain iterations are calculated. Improvements to the SLS can be made either by selecting the initial allocation and in the nature of the local changes considered, or by trying to escape local lows.
