Constraint-based round robin tournament planning
Proceedings of the 1999 international conference on Logic programming
Minimization of the number of breaks in sports scheduling problems using constraint programming
DIMACS workshop on on Constraint programming and large scale discrete optimization
The Traveling Tournament Problem Description and Benchmarks
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Scheduling a Major College Basketball Conference
Operations Research
Exploring relaxation induced neighborhoods to improve MIP solutions
Mathematical Programming: Series A and B
A simulated annealing approach to the traveling tournament problem
Journal of Scheduling
An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
INFORMS Journal on Computing
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
A branch-and-cut algorithm for scheduling the highly-constrained Chilean soccer tournament
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
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
Balanced home-away assignments
Discrete Optimization
On the separation in 2-period double round robin tournaments with minimum breaks
Computers and Operations Research
More robust counting-based search heuristics with alldifferent constraints
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Counting-based search: branching heuristics for constraint satisfaction problems
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Sports scheduling is a very attractive application area not only because of the interesting mathematical structures of the problems, but also due to their importance in practice and to the big business that sports have become. In this paper, we introduce the Traveling Tournament Problem with Predefined Venues, which consists in scheduling a compact single round robin tournament with a predefined venue assignment for each game (i.e., the venue where each game takes place is known beforehand) while the total distance traveled by the teams is minimized. Three integer programming formulations are proposed and compared. We also propose some simple enumeration strategies to generate feasible solutions to real-size instances in a reasonable amount of time. We show that two original enumeration strategies outperform an improvement heuristic embedded within a commercial solver. Comparative numerical results are presented.