DFS* and the Traveling Tournament Problem
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.
Unable to display preview. Download preview PDF.
- 1.Benoist, T., Laburthe, F., Rottembourg, B.: Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems. In: Proceedings of CP-AI-OR 2001, Wye College, UK, pp. 15–26 (2001)Google Scholar
- 5.Irnich, S., Schrempp, U.: A new branch-and-price algorithm for the traveling tournament problem. Presented at Column Generation 2008, Aussois, France (June 17-20, 2008), http://www.gerad.ca/colloques/ColumnGeneration2008/slides/SIrnich.pdf (accessed March 07, 2009)
- 7.Trick, M.: Challenge Traveling Tournament Problems, http://mat.gsia.cmu.edu/TOURN/ (accessed March 07, 2009)
- 8.Urrutia, S., Ribeiro, C.C., Melo, R.A.: A new lower bound to the traveling tournament problem. In: IEEE Symposium on Computational Intelligence in Scheduling, pp. 15–18 (2007)Google Scholar
- 9.Vempaty, N.R., Kumar, V., Korf, R.E.: Depth-First vs Best-First Search. In: Proc. National Conf. on Artificial Intelligence, AAAI 1991, Anaheim, CA, pp. 434–440 (1991)Google Scholar
- 10.Wah, B.W.: MIDA*: An IDA* search with dynamic control. Technical report, Coordinated Science Laboratoy, University of Illinois, Urbana, Illinois (1991)Google Scholar