Novel neighborhood structures for incomplete round robin tournaments
Abstract
In this work, we study novel neighborhood structures for incomplete round robin tournaments. We show that the proposed neighborhoods introduce non-isomorphic games into the schedule, thereby increasing the solution space connectivity over existing neighborhoods. We also embed the neighborhoods in a metaheuristic and obtain several new best solutions for some selected problems involving timetabling an incomplete round robin tournament.
Fields of Study & Subjects
Scheduling and Timetabling Solutions
Constraint Satisfaction and Optimization
Scheduling and Optimization Algorithms
Publication details
- Journal / source
- Ghent University Academic Bibliography (Ghent University)
- Publication date
- 1 January 2026
- Language
- EN