A note on symmetry reduction for circular traveling tournament problems

作者：Gschwind Timo^*; Irnich Stefan

来源：European Journal of Operational Research, 2011, 210(2): 452-456.

DOI：10.1016/j.ejor.2010.08.015

• Timetabling
• Sports league scheduling
• Traveling tournament problem
• Circular instances
• Symmetry reduction

The traveling tournament problem (TTP) consists of finding a distance-minimal double round-robin tournament where the number of consecutive breaks is bounded. Easton et al. (2001) introduced the so-called circular TTP instances, where venues of teams are located on a circle. The distance between neighboring venues is one, so that the distance between any pair of teams is the distance on the circle. It is empirically proved that these instances are very hard to solve due to the inherent symmetry. This note presents new ideas to cut off essentially identical parts of the solution space. Enumerative solution approaches, e.g. relying on branch-and-bound, benefit from this reduction. We exemplify this benefit by modifying the DFS* algorithm of Uthus et al. (2009) and show that speedups can approximate factor 4n.

• 出版日期2011-4-16