A simulated annealing approach to the travelling tournament problem

Aris Anagnostopoulos, Laurent Michel, Pascal Van Hentenryck, Yannis Vergados

International Joint Conference on Artificial Intelligence · 2003 · 11 citations · 4 references

Concepts

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.

References

4