Explore: Tabu Search

Tabu search (TS) is a metaheuristic search method employing local search methods used for mathematical optimization. It was created by Fred W. Glover in

same cost. Tabu search overcomes this problem by maintaining a list of "forbidden" assignments, called the tabu list. In particular, the tabu list typically

methods must be used instead. For example, tabu search can be used to search for solutions to ILPs. To use tabu search to solve ILPs, moves can be defined as

local search heuristic in order to find better solutions. Such metaheuristics include simulated annealing, tabu search, iterated local search, variable

In optimization, line search is a basic iterative approach to find a local minimum x ∗ {\displaystyle \mathbf {x} ^{*}} of an objective function f : R

a stochastic search. This category includes a great variety of general metaheuristic methods, such as simulated annealing, tabu search, A-teams, and

and the related A* search algorithm are verifiably optimal greedy algorithms for graph search and shortest path finding. A* search is conditionally optimal

based on iterations (like iterated local search), or on memory (like reactive search optimization and tabu search), or on memory-less stochastic modifications

the instance, and of the local situation around the current solution. Tabu search (TS) Similar to simulated annealing in that both traverse the solution

Particle swarm optimization Simulated annealing Stochastic tunneling Tabu search Problems in rigid body dynamics (in particular articulated rigid body