Tabu search is a metaheuristic for combinatorial optimization that explores the search space by moving at each step to the best available neighboring solution, even one worse than the current solution, while maintaining a short-term memory called a tabu list that forbids revisiting recently examined moves or solutions for a number of iterations, preventing the search from cycling back to solutions it has already left and encouraging it to explore new regions of the search space. Fred Glover introduced the technique in 1986. It has been applied widely to scheduling, routing and other combinatorial problems where simple local search methods tend to get stuck in local optima.
Facts
Classification
Design TechniqueHeuristic or Approximation 1 Connections
In Field
Source Wikipedia: Tabu search
Uses Design Technique
Entity-backed identity for the design-technique enum value this algorithm already carries, resolved to a computing concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The design-technique fact itself stays on the algorithm unchanged.
Entity-backed identity for the design-technique enum value this algorithm already carries, resolved to a computing concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The design-technique fact itself stays on the algorithm unchanged.
Sources
1. Tabu Search Algorithm (Wikipedia)
Wikipedia: design technique heuristic-approximationQuote, Wikipedia: design technique heuristic-approximation
heuristic-approximation
2. Wikipedia: Tabu search
Lead section
It was created by Fred W. Glover in 1986
entity record, description (design-technique)
Tabu search is a metaheuristic for combinatorial optimization that explores the search space by moving at each step to the best available neighboring solution, even one worse than the current solution, while maintaining a short-term memory called a tabu list that forbids revisiting recently examined moves or solutions for a number of iterations, preventing the search from cycling back to solu
In Field: Evolutionary Computation, Lead sentence
Tabu search (TS) is a metaheuristic search method employing local search methods used for mathematical optimization.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.