A simulated annealing approach to the traveling tournament problem

Authors:
A. Anagnostopoulos;L. Michel;P. Van Hentenryck;Y. Vergados
Affiliations:
Brown University, Providence 02912;Aff1 Aff2;Brown University, Providence 02912;Brown University, Providence 02912
Venue:
Journal of Scheduling
Year:
2006

Citing 4
Cited 18

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

An ant colony optimization approach to the traveling tournament problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Population-based simulated annealing for traveling tournaments

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
The traveling tournament problem with predefined venues

Journal of Scheduling
A hybrid ILS heuristic to the referee assignment problem with an embedded MIP strategy

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
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
Referee assignment in sports leagues

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
On the application of graph colouring techniques in round-robin sports scheduling

Computers and Operations Research
Complexity of the traveling tournament problem

Theoretical Computer Science
On the separation in 2-period double round robin tournaments with minimum breaks

Computers and Operations Research
A wide-ranging computational comparison of high-performance graph colouring algorithms

Computers and Operations Research
Design and statistical analysis of a hybrid local search algorithm for course timetabling

Journal of Scheduling
Scheduling bipartite tournaments to minimize total travel distance

Journal of Artificial Intelligence Research
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
Towards a population-based framework for improving stochastic local search algorithms

Proceedings of the 14th annual conference on Genetic and evolutionary computation
An intelligent recommender system for trainers and trainees in a collaborative learning environment for UML

Intelligent Decision Technologies - Special issue on Multimedia/Multimodal Human-Computer Interaction in Knowledge-based Environments
Evolving neural network using hybrid genetic algorithm and simulated annealing for rainfall-runoff forecasting

ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
An investigation on the generality level of selection hyper-heuristics under different empirical conditions

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automating the scheduling of sport leagues has received considerable attention in recent years, as these applications involve significant revenues and generate challenging combinatorial optimization problems. This paper considers the traveling tournament problem (TTP) which abstracts the salient features of major league baseball (MLB) in the United States. It proposes a simulated annealing algorithm (TTSA) for the TTP that explores both feasible and infeasible schedules, uses a large neighborhood with complex moves, and includes advanced techniques such as strategic oscillation and reheats to balance the exploration of the feasible and infeasible regions and to escape local minima at very low temperatures. TTSA matches the best-known solutions on the small instances of the TTP and produces significant improvements over previous approaches on the larger instances. Moreover, TTSA is shown to be robust, because its worst solution quality over 50 runs is always smaller or equal to the best-known solutions.