Solving the Traveling Tournament Problem with Predefined Venues by Parallel Constraint Programming
The Traveling Tournament Problem with Predefined Venues (TTPPV) is a practical problem arising from sports scheduling. We describe two different modeling approaches for this problem, each of which is suitable for different sizes of instance. The experimental results show that our modeling approaches lead to improved performance compared to previous techniques in terms of the number of feasible solutions and the optimal value. Furthermore, we present how to execute the models in parallel through data-level parallelism. The parallel versions do not only gain speedup but also attain significant improvement on optimal value since more subtrees are searched independently.
KeywordsSports scheduling Constraint programming Parallel constraint solving TTPPV
- 1.Pesant, G.: CSPLib: a problem library for constraints. Accessed 08 Apr 2018Google Scholar
- 4.Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, Boston (1995)Google Scholar
- 7.Prud’homme, C., Fages, J.-G., Lorca, X.: Choco Documentation. TASC - LS2N CNRS UMR 6241, COSLING S.A.S. (2017)Google Scholar
- 9.Pesant, G.: A constraint programming approach to the traveling tournament problem with predefined venues. In: Practice and Theory of Automated Timetabling, pp. 303–316 (2012)Google Scholar