AI News, Artificial Intelligence/Search/Heuristic search/Tabu Search

Artificial Intelligence/Search/Heuristic search/Tabu Search

During this time he noticed that his colleagues did not use formal logic for problem solving themselves but would instead whittle down the problem space by avoiding previously tried steps if they proved unpromising (Glover 1998).

is a heuristic search algorithm used to solve combinatorial optimization problems, where a set of discrete feasible solutions is the problem space and the goal is to find the best possible solution (Glover 1989).

The ultimate goal of tabu restrictions then is to break out of local search space while maintaining the possibility of finding an optimal solution (Glover 1990).

To do this, aspiration criteria are employed to counterbalance the effect of tabu restrictions and allow the search to extend into a greater search field (Glover 1990).

Leonard Nimoy and Michael Medved at Hillsdale College

Michael Medved interviewed Leonard Nimoy (1931-2015) at Hillsdale College in 1989 as part of the CCA seminar on "Popular Entertainment and Its Impact on ...