The Traveling Tournament Problem Description and Benchmarks

Authors:
Kelly Easton;George L. Nemhauser;Michael Trick
Affiliations:
-;-;-
Venue:
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Year:
2001

Citing 3
Cited 30

Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Scheduling a Major College Basketball Conference

Operations Research
Scheduling a Major College Basketball Conference--Revisited

Operations Research

A simulated annealing approach to the traveling tournament problem

Journal of Scheduling
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
On the existence of sports schedules with multiple venues

Discrete Applied Mathematics
Bender's Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
DFS* and the Traveling Tournament Problem

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An ant colony optimization approach to the traveling tournament problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Population-based simulated annealing for traveling tournaments

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A simulated annealing approach to the travelling tournament problem

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The traveling tournament problem with predefined venues

Journal of Scheduling
An Improved Approximation Algorithm for the Traveling Tournament Problem

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Clustering search approach for the traveling tournament problem

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
A hybrid ILS heuristic to the referee assignment problem with an embedded MIP strategy

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Constructive algorithms for the constant distance traveling tournament problem

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Referee assignment in sports leagues

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
On the application of graph colouring techniques in round-robin sports scheduling

Computers and Operations Research
Complexity of the traveling tournament problem

Theoretical Computer Science
Automated personal course scheduling adaptive spreading activation model

ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part III
On the separation in 2-period double round robin tournaments with minimum breaks

Computers and Operations Research
A wide-ranging computational comparison of high-performance graph colouring algorithms

Computers and Operations Research
Mirrored traveling tournament problem: an evolutionary approach

IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Mathematical modeling and tabu search heuristic for the traveling tournament problem

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
The timetable constrained distance minimization problem

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Traveling tournament scheduling: a systematic evaluation of simulated annealling

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Scheduling bipartite tournaments to minimize total travel distance

Journal of Artificial Intelligence Research
A Benders approach for computing lower bounds for the mirrored traveling tournament problem

Discrete Optimization
Note: Solving mirrored traveling tournament problem benchmark instances with eight teams

Discrete Optimization
Towards a population-based framework for improving stochastic local search algorithms

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Solving the traveling tournament problem with iterative-deepening A*

Journal of Scheduling
New models for the Mirrored Traveling Tournament Problem

Computers and Industrial Engineering
Generating approximate solutions to the traveling tournament problem using a linear distance relaxation

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Traveling Tournament Problem is a sports timetabling problem that abstracts two issues in creating timetables: home/away pattern feasibility and team travel. Instances of this problem seem to be very difficult even for a very small number of teams, making it an interesting challenge for combinatorial optimization techniques such as integer programming and constraint programming. We introduce the problem, describe one way of modeling it, and give some interesting classes of instances with base computational results.