کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
478588 1446106 2011 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A note on symmetry reduction for circular traveling tournament problems
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A note on symmetry reduction for circular traveling tournament problems
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 210, Issue 2, 16 April 2011, Pages 452–456
نویسندگان
, ,