An ILS heuristic for the traveling tournament problem with predefined venues

DOI10.1007/s10479-010-0719-9zbMath1251.90127OpenAlexW2059343335MaRDI QIDQ1761896

Sebastián Urrutia, Fabrício N. Costa, Celso Carneiro Ribeiro

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0719-9

zbMATH Keywords

metaheuristicsiterated local searchsports schedulingtraveling tournament problemneighborhoods

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

A variable neighborhood search method for solving the traveling tournaments problem ⋮ Edge coloring: a natural model for sports scheduling ⋮ A new neighborhood structure for round robin scheduling problems ⋮ Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 ⋮ Round-robin scheduling with regard to rest differences ⋮ A multi-round generalization of the traveling tournament problem and its application to Japanese baseball ⋮ Complexity of the unconstrained traveling tournament problem ⋮ Sports scheduling: Problems and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling in sports: an annotated bibliography
• Heuristics for the mirrored traveling tournament problem
• A simulated annealing approach to the traveling tournament problem
• Scheduling non-professional table-tennis leagues
• The traveling tournament problem with predefined venues
• Round robin scheduling -- a survey
• Scheduling in Sports
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: An ILS heuristic for the traveling tournament problem with predefined venues