A composite-neighborhood tabu search approach to the traveling tournament problem

The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a family of tabu search solvers for the solution of TTP that make use of complex combination of many neighborhood structures. The different neighborhoods have been thoroughly analyzed and experimentally compared. We evaluate the solvers on three sets of publicly available benchmarks and we show a comparison of their outcomes with previous results presented in the literature. The results show that our algorithm is competitive with those in the literature.

• Type: Journal
• Year: 2007
• Where: HEURISTICS
• Authors: Luca Di Gaspero, Andrea Schaerf
• Keywords: Combinatorial Problem, HEURISTICS 2007, Tournament Problem, Traveling Salesman Problem