.png){kind=icon}
返回
The timetable constrained distance minimization problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-008-0384-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be minimized. The problem consists of finding an optimal home-away assignment when the opponents of each team in each time slot are given. We present an integer programming, a constraint programming formulation and describe two alternative solution methods: a hybrid integer programming/constraint programming approach and a branch and price algorithm. We test all four solution methods on benchmark problems and compare the performance. Furthermore, we present a new heuristic solution method called the circular traveling salesman approach (CTSA) for solving the traveling tournament problem. The solution method is able to obtain high quality solutions almost instantaneously, and by applying the TCDMP, we show how the solutions can be further improved.
Keyword:
Timetabling
Integer programming
Constraint programming
Sports scheduling
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
Outcomes for Management of Lichen Sclerosus Urethral Strictures by 3 Different Techniques.png)
Urology
UrologyIF0
PREAI
分享收藏分享收藏Influence of Finite Element Modeling Choices in the Assessment of Stress Concentrations at Fatigue Prone Locations in Orthotropic Bridge Decks正交各向异性桥面板疲劳易发区域应力集中评估中有限元建模选择的影响
PREAI
分享收藏
分享收藏
查看更多内容