2003 | OriginalPaper | Chapter
Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach
Authors : Kelly Easton, George Nemhauser, Michael Trick
Published in: Practice and Theory of Automated Timetabling IV
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The Travelling Tournament Problem is a sports timetabling problem requiring production of a minimum distance double round-robin tournament for a group of n teams. Even small instances of this problem seem to be very difficult to solve. In this paper, we present the first provably optimal solution for an instance of eight teams. The solution methodology is a parallel implementation of a branch-and-price algorithm that uses integer programming to solve the master problem and constraint programming to solve the pricing problem. Additionally, constraint programming is used as a primal heuristic.