Scheduling social tournaments locally

Authors:
Iván Dotú;Pascal Van Hentenryck
Affiliations:
Departamento De Ingeniería Informática, Universidad Autónoma de Madrid, Spain;Brown University, Box 1910, Providence, RI 02912, USA
Venue:
AI Communications - Constraint Programming for Planning and Scheduling
Year:
2007

Citing 7
Cited 0

Symmetry Breaking

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Reducing search space in local search for constraint satisfaction

Eighteenth national conference on Artificial intelligence
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Solving Kirkman's Schoolgirl Problem in a Few Seconds

Constraints
Symmetry Breaking Revisited

Constraints
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Scheduling social golfers locally

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tournament scheduling, such as the social golfer problem, has attracted significant attention in recent years because of their highly symmetrical and combinatorial nature. This paper presents an effective local search algorithm for a variety of tournament scheduling problems, including social golfer problems, debating tournaments, judge assignments and very social golfers. The algorithm finds high-quality solutions on all problems, including new solutions to open problems. Interestingly, the algorithm does not incorporate any symmetry-breaking schemes and is conceptually simple when compared to advanced constraint-programming solutions.