A Variable Neighborhood Search Method for Solving the Traveling Tournaments Problem

This paper proposes a variable neighborhood search based method (VNS) for the traveling tournaments problem in sport scheduling (TTP). The proposed method starts with a feasible configuration verifying the problem constraints. Then a search process is launched in order to find an approximate solution minimizing the total traveled distance. The proposed method is implemented and tested on benchmarks to measure its performance. The proposed method succeeds in finding good quality solutions for the TTP.