A Tabu Search Approach to the Traveling Tournament Problem


The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features both from the traveling salesman problem and from tournament scheduling. We propose a tabu search approach to the solution of TTP that makes use of a combination of two neighborhood relations. The algorithm has been experimentally analyzed on several sets of publicly available benchmarks and we show a comparison with previous approaches presented in the literature.

Atti della Giornata di Lavoro del gruppo RCRA 2005: Analisi sperimentale e benchmark di algoritmi per l’Intelligenza Artificiale