A simulated annealing approach to the traveling tournament problem

DOI10.1007/s10951-006-7187-8zbMath1154.90401OpenAlexW2157841753WikidataQ116754417 ScholiaQ116754417MaRDI QIDQ880541

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

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-006-7187-8

zbMATH Keywords

Simulated annealingLocal searchSport schedulingTravelling tournament problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (35)

Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America ⋮ A combined local search and integer programming approach to the traveling tournament problem ⋮ A variable neighborhood search method for solving the traveling tournaments problem ⋮ The timetable constrained distance minimization problem ⋮ Edge coloring: a natural model for sports scheduling ⋮ Sports scheduling search space connectivity: a riffle shuffle driven approach ⋮ A new neighborhood structure for round robin scheduling problems ⋮ Heuristics for the mirrored traveling tournament problem ⋮ Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 ⋮ A novel non-linear approach to minimal area rectangular packing ⋮ Optimization in dubbing scheduling ⋮ Approximation algorithms for \(\mathrm{TTP(2)}\) ⋮ Complexity of the traveling tournament problem ⋮ Confection de calendriers de matchs pour le sport universitaire et collégial au Québec ⋮ A multi-round generalization of the traveling tournament problem and its application to Japanese baseball ⋮ Round robin tournaments and three index assignments ⋮ Scheduling sports competitions at multiple venues -- revisited ⋮ A further improvement on approximating TTP-2 ⋮ Solving mirrored traveling tournament problem benchmark instances with eight teams ⋮ A 5.875-approximation for the traveling tournament problem ⋮ The sport teams grouping problem ⋮ Round robin scheduling -- a survey ⋮ Complexity of the unconstrained traveling tournament problem ⋮ Sports scheduling: Problems and applications ⋮ A wide-ranging computational comparison of high-performance graph colouring algorithms ⋮ An ILS heuristic for the traveling tournament problem with predefined venues ⋮ An approximation algorithm for the traveling tournament problem ⋮ On the separation in 2-period double round robin tournaments with minimum breaks ⋮ On the application of graph colouring techniques in round-robin sports scheduling ⋮ The traveling tournament problem with predefined venues ⋮ Maximizing breaks and bounding solutions to the mirrored traveling tournament problem ⋮ A simulated annealing and hill-climbing algorithm for the traveling tournament problem ⋮ A complete search method for the relaxed traveling tournament problem ⋮ A Benders approach for computing lower bounds for the mirrored traveling tournament problem ⋮ A beam search approach to the traveling tournament problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• TSP ejection chains
• Tabu search for the multilevel generalized assignment problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• General Purpose Simulated Annealing
• A tabu search heuristic for the generalized assignment problem

This page was built for publication: A simulated annealing approach to the traveling tournament problem