TY - GEN
T1 - The Traveling Tournament Problem
T2 - 17th International Joint Conference on Computational Intelligence, IJCCI 2025
AU - Loyen, Bas
AU - Bart, Duncan
AU - Richoux, Florian
AU - van den Berg, Daan
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.
PY - 2026
Y1 - 2026
N2 - We generate all 160 valid solutions for the traveling tournament problem with 4 teams, and randomly select 10,000 valid solutions for 6, 8 and 10 teams. For every number of teams, the difference between any two valid solutions is taken an charted. It turns out these differences are very large, even when a key constraint, the home/away assignment, is completely ignored. These results might signal that the use of metaheuristic algorithms for this problem might be highly problematic.
AB - We generate all 160 valid solutions for the traveling tournament problem with 4 teams, and randomly select 10,000 valid solutions for 6, 8 and 10 teams. For every number of teams, the difference between any two valid solutions is taken an charted. It turns out these differences are very large, even when a key constraint, the home/away assignment, is completely ignored. These results might signal that the use of metaheuristic algorithms for this problem might be highly problematic.
UR - https://www.scopus.com/pages/publications/105029536618
UR - https://www.scopus.com/pages/publications/105029536618#tab=citedBy
U2 - 10.1007/978-3-032-15635-8_30
DO - 10.1007/978-3-032-15635-8_30
M3 - Conference contribution
AN - SCOPUS:105029536618
SN - 9783032156341
VL - 2
T3 - Communications in Computer and Information Science
SP - 491
EP - 503
BT - Computational Intelligence
A2 - Marcelloni, Francesco
A2 - Madani, Kurosh
A2 - van Stein, Niki
A2 - Filipe, Joaquim
PB - Springer Nature Switzerland AG
Y2 - 22 October 2025 through 24 October 2025
ER -