Solving the Traveling Tournament Problem with Iterative-Deepening A*

Authors

  • David Uthus Naval Research Laboratory
  • Patricia Riddle University of Auckalnd
  • Hans Guesgen Massey University

DOI:

https://doi.org/10.1609/icaps.v23i1.13576

Abstract

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.

Downloads

Published

2013-06-02

How to Cite

Uthus, D., Riddle, P., & Guesgen, H. (2013). Solving the Traveling Tournament Problem with Iterative-Deepening A*. Proceedings of the International Conference on Automated Planning and Scheduling, 23(1), 488-489. https://doi.org/10.1609/icaps.v23i1.13576

Issue

Vol. 23 (2013): Twenty-Third International Conference on Automated Planning and Scheduling

Section

Journal Presentation Track