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

Goerigk, Marc and Westphal, Stephan (2016) A combined local search and integer programming approach to the traveling tournament problem. Annals of Operations Research, 239 (1). pp. 343-354. ISSN 0254-5330

Full text not available from this repository.

Abstract

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.

Item Type:
Journal Article
Journal or Publication Title:
Annals of Operations Research
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1800/1803
Subjects:
ID Code:
76544
Deposited By:
Deposited On:
10 Nov 2015 10:12
Refereed?:
Yes
Published?:
Published
Last Modified:
07 Jan 2020 04:38