Tabu search, created by Fred W. Glover in 1986 and formalized in 1989, is a local search method used for mathematical optimization.
Local searches take a potential solution to a problem and check its immediate neighbors (that is, solutions that are similar except for one or two minor details) in the hope of finding an improved solution. Local search methods have a tendency to become stuck in suboptimal regions or on plateaus where many solutions are equally fit.
Tabu search enhances the performance of these techniques by using memory structures that describe the visited solutions or user-provided sets of rules. If a potential solution has been previously visited within a certain short-term period or if it has violated a rule, it is marked as "taboo" ("tabu" being a different spelling of the same word) so that the algorithm does not consider that possibility repeatedly.
Read more about Tabu Search: Basic Description, Pseudo-code, Example: Traveling Salesman Problem, TS-PSO Algorithm
Famous quotes containing the word search:
“The danger lies in forgetting what we had. The flow between generations becomes a trickle, grandchildren tape-recording grandparents’ memories on special occasions perhaps—no casual storytelling jogged by daily life, there being no shared daily life what with migrations, exiles, diasporas, rendings, the search for work. Or there is a shared daily life riddled with holes of silence.”
—Adrienne Rich (b. 1929)