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 improved American highway system ... isolated the American-in-transit. On his speedway ... he had no contact with the towns which he by-passed. If he stopped for food or gas, he was served no local fare or local fuel, but had one of Howard Johnson’s nationally branded ice cream flavors, and so many gallons of Exxon. This vast ocean of superhighways was nearly as free of culture as the sea traversed by the Mayflower Pilgrims.”
—Daniel J. Boorstin (b. 1914)
“Still, I search in these woods and find nothing worse
than myself, caught between the grapes and the thorns.”
—Anne Sexton (1928–1974)