Scholarlink

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.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

The Traveling Tournament Problem: Valid Solutions Are Different Across Instance Sizes

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Bas Loyen,
  • Duncan Bart,
  • Florian Richoux,
  • Daan van den Berg

摘要

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.