A simulated annealing approach to the traveling tournament problem
Lists
Only you see this
Abstract
Automating the scheduling of sport leagues has received considerable attention in recent years. This paper considers the traveling tournament problem (TTP) proposed in [8; 4] to abstract the salient features of major league baseball (MLB) in the United States. It proposes a simulated annealing algorithm (TTSA) for the TTP that produces significant improvements over previous approaches. Introduction The scheduling of sport leagues has become an important class of combinatorial optimization applications in recent years since they represent significant sources of revenue and generate extremely challenging optimization problems. This paper considers the travelling tournament problem
BibTeX
@article{anagnostopoulos2006simulated,
author = {Aris Anagnostopoulos and Laurent Michel and Pascal Van Hentenryck and Yannis Vergados},
title = {{A simulated annealing approach to the traveling tournament problem}},
journal = {J. Sched.},
year = {2006},
doi = {10.1007/s10951-006-7187-8},
}Loading related content...