Journal ArticleDOI
The traveling tournament problem with predefined venues
TLDR
This paper introduces 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 while the total distance traveled by the teams is minimized.Abstract:
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.read more
Citations
More filters
Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007 : proceedings
TL;DR: Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches and Connections in Networks: Hardness of Feasibility Versus Optimality.
Journal ArticleDOI
Invited Review: Scheduling in sports: An annotated bibliography
TL;DR: This paper provides an annotated bibliography for sports scheduling articles, noticeable that the number of papers has risen in recent years, demonstrating that scientific interest is increasing in this area.
Journal ArticleDOI
Sports scheduling: Problems and applications
TL;DR: An introductory review of fundamental problems in sports scheduling and their formulations, followed by a survey of applications of optimization methods to scheduling problems in professional leagues of different sport disciplines such as football, baseball, basketball, cricket, and hockey.
Journal ArticleDOI
Counting-based search: branching heuristics for constraint satisfaction problems
TL;DR: Experimental results show that counting-based search generally outperforms other generic heuristics and identifies heuristic maxSD as a robust candidate among the authors' proposals.
Journal ArticleDOI
An ILS heuristic for the traveling tournament problem with predefined venues
TL;DR: An Iterated Local Search (ILS) heuristic for solving real-size instances of the TTPPV, based on two types of moves, is proposed and it is shown that the new ILS heuristic performs much better than heuristics based on integer programming and that it improves the best known solutions for benchmark instances.
References
More filters
Book
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
TL;DR: This book discusses Real-Time Scheduling Problems, Scheduling Models, Stochastic Scheduling, and Online Deterministic Scheduling as well as some basic Scheduling Algorithms and Complexity.
Journal ArticleDOI
Exploring relaxation induced neighborhoods to improve MIP solutions
TL;DR: Two new approaches to exploring interesting, domain-independent neighborhoods in MIP are considered, the more effective of the two, which is called Relaxation Induced Neighborhood Search (RINS), constructs a promising neighborhood using information contained in the continuous relaxation of the MIP model.
Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007 : proceedings
TL;DR: Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches and Connections in Networks: Hardness of Feasibility Versus Optimality.
Book ChapterDOI
Replenishment Planning for Stochastic Inventory Systems with Shortage Cost
TL;DR: This paper develops a CP approach able to compute optimal (R n ,S n ) policy parameters under stochastic demand, ordering, holding and shortage costs and uses the optimal solutions to analyze the quality of the solutions provided by an approximate MIP approach that exploits a piecewise linear approximation for the cost function.
Journal ArticleDOI
Round robin scheduling – a survey
TL;DR: A comprehensive survey on the literature considering round robin tournaments, outlining the contributions presented during the last 30 years and discussing directions for future research within the area.