首页> 外文会议>Proceedings of the Twenty-Third International conference on Automated planning and Scheduling >Solving the Traveling Tournament Problem with Iterative-Deepening A
【24h】

Solving the Traveling Tournament Problem with Iterative-Deepening A

机译:用迭代加深A解决旅行比赛问题

获取原文
获取原文并翻译 | 示例

摘要

We give an overview of our journal paper on applying iterative-deepening A~* to the traveling tournament problem, a combinatorial optimization problem from the sports scheduling literature. This approach involved combining past ideas and creating new ideas to help reduce node expansion. This resulted in a state-of-the-art approach for optimally solving instances of the traveling tournament problem. It was the first approach to solve the classic NL10 and CIRC10 instances, which had not been solved since the problem's introduction.
机译:我们概述了关于将迭代加深A〜*应用于旅行锦标赛问题(这是体育调度文献中的组合优化问题)的期刊论文的概述。这种方法涉及结合过去的想法并创建新的想法以帮助减少节点扩展。这导致了一种用于最佳解决旅行锦标赛问题实例的最新方法。这是解决经典NL10和CIRC10实例的第一种方法,自引入问题以来一直没有解决。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号