Population-based simulated annealing for traveling tournaments

Authors:
Pascal Van Hentenryck;Yannis Vergados
Affiliations:
Brown University, Providence, RI;Brown University, Providence, RI
Venue:
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Year:
2007

Citing 6
Cited 4

Parallel simulated annealing algorithms

Journal of Parallel and Distributed Computing
Parallel Simulated Annealing Algorithms in Global Optimization

Journal of Global Optimization
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 traveling tournament problem

Journal of Scheduling
A composite-neighborhood tabu search approach to the traveling tournament problem

Journal of Heuristics
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

An ant colony optimization approach to the traveling tournament problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Towards a population-based framework for improving stochastic local search algorithms

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Sequential Monte Carlo simulated annealing

Journal of Global Optimization
A new populatoin-based simulated annealing algorithm

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reconsiders the travelling tournament problem, a complex sport-scheduling application which has attracted significant interest recently. It proposes a population-based simulated annealing algorithm With both itensification and diversitication. The algorithm is organized as a series of simulated annealing waves, each wave being followed by a macro-intensification. The diversification is obtained through the concept of elite runs that opportunistically survive waves. A parallel implementation of the algorithm on a cluster of workstations exhibits remarkable results. It improves the best known solutions on all considered benchmarks, sometimes reduces the optimality gap by about 60%, and produces novel best solutions on instances that had been stable for several years.