Proceedings

A Simulated Annealing Approach to the Travelling Tournament Problem

Download BibTeX Cite

Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1357-1357.

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 (TISA) for the TIP that produces significant improvements over previous approaches.

Aris Anagnostopoulos, Laurent Michel, Pascal Van Hentenryck, and Yannis Vergados. 2003. A Simulated Annealing Approach to the Travelling Tournament Problem. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03. IJCAI, 1357–1357. https://ijcai.org/proceedings/2003/196
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards