Home > Research > Publications & Outputs > A combined local search and integer programming...

Associated organisational unit


Text available via DOI:

View graph of relations

A combined local search and integer programming approach to the traveling tournament problem

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>04/2016
<mark>Journal</mark>Annals of Operations Research
Issue number1
Number of pages12
Pages (from-to)343-354
Publication StatusPublished
Early online date6/04/14
<mark>Original language</mark>English


The traveling tournament problem is a well-known combinatorial optimization problem with direct applications to sport leagues scheduling, that sparked intensive algorithmic research over the last decade. With the Challenge Traveling Tournament Instances as an established benchmark, the most successful approaches to the problem use meta-heuristics like tabu search or simulated annealing, partially heavily parallelized. Integer programming based methods on the other hand are hardly able to tackle larger benchmark instances. In this work we present a hybrid approach that draws on the power of commercial integer programming solvers as well as the speed of local search heuristics. Our proposed method feeds the solution of one algorithm phase to the other one, until no further improvements can be made. The applicability of this method is demonstrated experimentally on the galaxy instance set, resulting in currently best known solutions for most of the considered instances.