DFS* and the Traveling Tournament Problem

Authors:
David C. Uthus;Patricia J. Riddle;Hans W. Guesgen
Affiliations:
University of Auckland, Auckland, New Zealand;University of Auckland, Auckland, New Zealand;Massey University, Palmerston North, New Zealand
Venue:
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2009

Citing 4
Cited 1

Reducing reexpansions in iterative-deepening search by controlling cutoff bounds

Artificial Intelligence
The Traveling Tournament Problem Description and Benchmarks

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint Processing

Constraint Processing
Parallel Combinatorial Optimization (Wiley Series on Parallel and Distributed Computing)

Parallel Combinatorial Optimization (Wiley Series on Parallel and Distributed Computing)

Solving the traveling tournament problem with iterative-deepening A*

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our paper presents a new exact method to solve the traveling tournament problem. More precisely, we apply DFS* to this problem and improve its performance by keeping the expensive heuristic estimates in memory to help greatly cut down the computational time needed. We further improve the performance by exploiting a symmetry property found in the traveling tournament problem. Our results show that our approach is one of the top performing approaches for this problem. It is able to find known optimal solutions in a much smaller amount of computational time than past approaches, to find a new optimal solution, and to improve the lower bounds of larger problem instances which do not have known optimal solutions. As a final contribution, we also introduce a new set of problem instances to diversify the available instance sets for the traveling tournament problem.