A simulated annealing approach to the travelling tournament problem

Authors:
A. Anagnostopoulos;L. Michel;P. Van Hentenryck;Y. Vergados
Affiliations:
Brown University, Providence, RI;Brown University, Providence, RI;Brown University, Providence, RI;Brown University, Providence, RI
Venue:
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Year:
2003

Citing 3
Cited 2

TSP ejection chains

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Tabu Search

Tabu Search
The Traveling Tournament Problem Description and Benchmarks

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming

Three improved variants of simulated annealing for optimising dorm room assignments

International Journal of Intelligent Information and Database Systems
Traveling tournament scheduling: a systematic evaluation of simulated annealling

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

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.