Tabu Search

Tabu Search

       Tabu search is a metaheuristic that uses a list of states that have already been visited to attempt to avoid repeating paths.

       The tabu search metaheuristic is used in combination with another heuristic and operates on the principle that it is worth going down a path that appears to be poor if it avoids following a path that has already been visited.

       In this way, tabu search is able to avoid local maxima.