Ant Colony Optimization and the Single Round Robin Maximum Value Problem
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
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
An overview of AI research in Italy
Artificial intelligence
On the application of graph colouring techniques in round-robin sports scheduling
Computers and Operations Research
On the separation in 2-period double round robin tournaments with minimum breaks
Computers and Operations Research
Local search for Boolean Satisfiability with configuration checking and subscore
Artificial Intelligence
| Hi-index | 0.01 |
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a family of tabu search solvers for the solution of TTP that make use of complex combination of many neighborhood structures. The different neighborhoods have been thoroughly analyzed and experimentally compared. We evaluate the solvers on three sets of publicly available benchmarks and we show a comparison of their outcomes with previous results presented in the literature. The results show that our algorithm is competitive with those in the literature.