arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.09065cs.DScs.DM
收藏

最大行程长度为2的旅游竞赛问题的改进调度算法

An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two

Diptendu Chatterjee, Bimal Kumar Roy

摘要:

巡回赛问题(TTP)是一个组合优化问题,它要求在给定的约束条件下,使参加双循环赛的所有队伍的总行程最小。大多数情况下,这个问题超过十个团队仍然没有解决。根据问题的定义,参与的团队数量必须是偶数。根据约束条件的不同,这个问题有不同的变体。在这个问题中,我们考虑的情况下,球队的数量是四的倍数,一个球队不能发挥超过两个连续的主场或客场比赛。我们的调度算法给出了更好的结果比现有的最佳结果的团队数量小于或等于32。

英文摘要:

The Traveling Tournament Problem(TTP) is a combinatorial optimization problem where we have to give a scheduling algorithm which minimizes the total distance traveled by all the participating teams of a double round-robin tournament maintaining given constraints. Most of the instances of this problem with more than ten teams are still unsolved. By definition of the problem the number of teams participating has to be even. There are different variants of this problem depending on the constraints. In this problem, we consider the case where number of teams is a multiple of four and a team can not play more than two consecutive home or away matches. Our scheduling algorithm gives better result than the existing best result for number of teams less or equal to 32.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑