旅行锦标赛问题：概述
The Traveling Tournament Problem: An Overview
- Ghent University（根特大学）
- Shanghai Normal University（上海师范大学）
- Carnegie Mellon University in Qatar（卡内基梅隆大学卡塔尔分校）
机构由 AI 辅助整理，请以论文原文为准。
中文总结 AI 辅助
本文概述旅行锦标赛问题（TTP）的研究现状，涵盖其起源、问题变体、算法进展，延续相关资源库并提出未来研究方向。
中文摘要 AI 辅助
在过去25年中，旅行锦标赛问题（Traveling Tournament Problem, TTP）已成为体育赛程安排领域研究最广泛的优化问题之一。TTP的核心目标是最小化球队在连续客场比赛中直接往返对手场地产生的总旅行距离。该问题起源于美国职业棒球大联盟（Major League Baseball）的赛程安排挑战，被确定为其中的核心计算难点。本文提供了TTP相关文献的全面概述：我们回顾了主要的问题变体和基准实例，总结了下界、近似保证以及精确和启发式优化算法的当前研究现状；此外，我们通过跟踪和验证上下界，为该领域的持续发展做出贡献，该工作延续了Michael Trick教授最初作为RobinX体育赛程安排项目一部分建立的资源库；最后，我们确定了几个开放性问题，并概述了未来研究的有前景方向。
英文摘要
Over the past 25 years, the Traveling Tournament Problem (TTP) has become one of the most extensively studied optimization problems in sports scheduling. At its core, the TTP seeks to minimize the total travel distance incurred by teams that travel directly between opponents' venues during consecutive away games. The problem originated from the scheduling challenges faced by Major League Baseball, where it was identified as the central computational difficulty. This paper provides a comprehensive overview of the literature on the TTP. We review the principal problem variants and benchmark instances, and summarize the current state of the art in lower bounds, approximation guarantees, and exact and heuristic optimization algorithms. Moreover, we contribute to the continued development of the field by tracking and validating lower and upper bounds, while succeeding the repository originally established by Prof. Michael Trick as part of the RobinX sports timetabling project. Finally, we identify several open questions and outline promising directions for future research.
