Local Search (optimization)
In computer science, local search is a metaheuristic 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. Examples of local search algorithms are WalkSAT and the 2-opt algorithm for the Traveling Salesman Problem.
Read more about Local Search (optimization): Examples, Description
Famous quotes containing the words local and/or search:
“The difference between de jure and de facto segregation is the difference open, forthright bigotry and the shamefaced kind that works through unwritten agreements between real estate dealers, school officials, and local politicians.”
—Shirley Chisholm (b. 1924)
“I never found even in my juvenile hours that it was necessary to go a thousand miles in search of themes for moralizing.”
—Horace Walpole (1717–1797)