一种改进的邻域法求解旅游竞赛问题
An Improved Neighbourhood for the Traveling Tournament Problem
摘要:
巡回赛问题(TTP)是一个具有挑战性的组合优化问题,引起了国内外学者的广泛兴趣。本文提出了一种改进的搜索邻域的TTP,已在模拟退火的情况下进行了测试。邻域包含可行和不可行的时间表,并且可以有效地生成。对于多达40个团队的最大TTP挑战问题,使用该邻域找到的解决方案是目前已知的最佳解决方案,对于10个团队的较小问题,找到的三个解决方案随后被证明是最佳的。
英文摘要:
The Traveling Tournament Problem (TTP) is a challenging combinatorial optimization problem that has attracted the interest of researchers around the world. This paper proposes an improved search neighbourhood for the TTP that has been tested in a simulated annealing context. The neighbourhood encompasses both feasible and infeasible schedules, and can be generated efficiently. For the largest TTP challenge problems with up to 40 teams, solutions found using this neighbourhood are the best currently known, and for smaller problems with 10 teams, three solutions found were subsequently proven optimal.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。