AAAI Publications, Twenty-Third International Conference on Automated Planning and Scheduling

Font Size: 
Solving the Traveling Tournament Problem with Iterative-Deepening A*
David Uthus, Patricia J. Riddle, Hans W. Guesgen

Last modified: 2013-06-02


We give an overview of our journal paper on applying iterative-deepening A* to the traveling tournament problem, a combinatorial optimization problem from the sports scheduling literature. This approach involved combining past ideas and creating new ideas to help reduce node expansion. This resulted in a state-of-the-art approach for optimally solving instances of the traveling tournament problem. It was the first approach to solve the classic NL10 and CIRC10 instances, which had not been solved since the problem’s introduction.

Full Text: PDF