Tabu Search

Tabu search is a metaheuristic search method employing local search methods used for mathematical optimization.<div><br></div><div>Local (neighborhood) 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.</div><div><br></div><div>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 "tabu" (forbidden) so that the algorithm does not consider that possibility repeatedly.</div>
  • {{comment.username}}
submission(s) pending review
Bounty expires in
Bounty expired
(no tags)