Traveling tournament scheduling: a systematic evaluation of simulated annealling

Authors:
Pascal Van Hentenryck;Yannis Vergados
Affiliations:
Computer Science Department, Brown University, Providence, RI;Computer Science Department, Brown University, Providence, RI
Venue:
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2006

Citing 6
Cited 5

A hill-climbing algorithm for the contruction of one-factorizations and room squares

SIAM Journal on Algebraic and Discrete Methods
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
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
A simulated annealing approach to the travelling tournament problem

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Population-based simulated annealing for traveling tournaments

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Clustering search approach for the traveling tournament problem

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Constructive algorithms for the constant distance traveling tournament problem

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A Benders approach for computing lower bounds for the mirrored traveling tournament problem

Discrete Optimization
Note: Solving mirrored traveling tournament problem benchmark instances with eight teams

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers all the variants of the traveling tournament problem (TTP) proposed in [17, 7] to abstract the salient features of major league baseball (MLB) in the United States. The variants include different distance metrics and both mirrored and non-mirrored schedules. The paper shows that, with appropriate enhancements, simulated annealing is robust across the distance metrics and mirroring. In particular, the algorithm matches or improves most best-known solutions and produces numerous new best solutions spread over all classes of problems. The main technical contribution underlying these results is a number of compositive neighborhood moves that aggregate sequences of existing moves; these novel moves preserve the mirroring or distance structure of the candidate schedule, while performing interesting transformations.