An ILS heuristic for the traveling tournament problem with predefined venues
From MaRDI portal
Publication:1761896
DOI10.1007/s10479-010-0719-9zbMath1251.90127MaRDI 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
metaheuristics; iterated local search; sports scheduling; traveling tournament problem; neighborhoods
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Sports scheduling: Problems and applications, Round-robin scheduling with regard to rest differences, Edge coloring: a natural model for sports scheduling, A multi-round generalization of the traveling tournament problem and its application to Japanese baseball, A new neighborhood structure for round robin scheduling problems, Complexity of the unconstrained traveling tournament problem, Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021, A variable neighborhood search method for solving the traveling tournaments problem
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