首页> 外文会议>4th International Conference on Practice and Theory of Automated Timetabling IV PATAT 2002 Aug 21-23, 2002 Gent, Belgium >Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach
【24h】

Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach

机译:解决旅行比赛问题:整数规划与约束规划相结合的方法

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

摘要

The Travelling Tournament Problem is a sports timetabling problem requiring production of a minimum distance double round-robin tournament for a group of n teams. Even small instances of this problem seem to be very difficult to solve. In this paper, we present the first provably optimal solution for an instance of eight teams. The solution methodology is a parallel implementation of a branch-and-price algorithm that uses integer programming to solve the master problem and constraint programming to solve the pricing problem. Additionally, constraint programming is used as a primal heuristic.
机译:旅行锦标赛问题是一项体育时间表问题,要求为n组球队进行最小距离双循环赛。这个问题的很小的实例似乎也很难解决。在本文中,我们提出了针对八个团队的第一个可证明的最佳解决方案。解决方案方法是分支定价算法的并行实现,该算法使用整数编程来解决主问题,并使用约束编程来解决定价问题。另外,约束编程被用作原始启发式算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号