The timetable constrained distance minimization problem

Authors:
Rasmus V. Rasmussen;Michael A. Trick
Affiliations:
Department of Operations Research, University of Aarhus, Aarhus C, Denmark;Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA
Venue:
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2006

Citing 11
Cited 5

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
Scheduling Sport Tournaments using Constraint Logic Programming

Constraints
A Schedule-Then-Break Approach to Sports Timetabling

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
The Traveling Tournament Problem Description and Benchmarks

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
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
Scheduling the Italian football league: an ILP-based approach

Computers and Operations Research
Semidefinite programming based approaches to the break minimization problem

Computers and Operations Research
Minimizing breaks by maximizing cuts

Operations Research Letters

A meeting scheduling problem respecting time and space

Geoinformatica
The traveling tournament problem with predefined venues

Journal of Scheduling
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
Scheduling meetings in distance learning

APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Note: Solving mirrored traveling tournament problem benchmark instances with eight teams

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Timetable Constrained Distance Minimization Problem is a sports scheduling problem applicable for tournaments where the total travel distance must be minimized. In this paper we define the problem and present an integer programming and a constraint programming formulation for the problem. Furthermore, we describe a hybrid integer programming/constraint programming approach and a branch and bound algorithm for solving the Timetable Constrained Distance Minimization Problem. Finally, the computational performances of the four solution methods are tested and compared.