Glossary

Algorithm used for solving combinatorial optimization problems

Tabu search is a metaheuristic algorithm that can be used for solving combinatorial optimization problems, such as the traveling salesman problem (TSP).

Tabu search uses a local or neighbourhood search procedure to iteratively move from a solution x to a solution x’ in the neighbourhood of x, until some stopping criterion has been satisfied.