ML Anthology

A Simulated Annealing Approach to the Travelling Tournament Problem

Aris Anagnostopoulos, Laurent Michel, Pascal Van Hentenryck, Yannis Vergados
IJCAI 2003 pp. 1357-1358
/ijcai/2003/anagnostopoulos2003ijcai-simulated/

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.

PDF Semantic Scholar

Cite

Text

Anagnostopoulos et al. "A Simulated Annealing Approach to the Travelling Tournament Problem." International Joint Conference on Artificial Intelligence, 2003.

Markdown

[Anagnostopoulos et al. "A Simulated Annealing Approach to the Travelling Tournament Problem." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/anagnostopoulos2003ijcai-simulated/)

BibTeX

@inproceedings{anagnostopoulos2003ijcai-simulated,
  title     = {{A Simulated Annealing Approach to the Travelling Tournament Problem}},
  author    = {Anagnostopoulos, Aris and Michel, Laurent and Van Hentenryck, Pascal and Vergados, Yannis},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2003},
  pages     = {1357-1358},
  url       = {https://mlanthology.org/ijcai/2003/anagnostopoulos2003ijcai-simulated/}
}