Time-Relaxed Travelling Tournament Problem Sample Clauses

Time-Relaxed Travelling Tournament Problem. ‌ In a t-round-xxxxx tournament, every team plays every other team a fixed number t times during the competition. So in a double round-xxxxx (or DRR), every team plays exactly two matches against every other team, one at their home venue and one at the home venue of the opponent. In a time-relaxed environment a competition has K timeslots more available than are required to schedule all matches. These K additional timeslots are filled with byes, i.e. timeslots where a team does not play a match. The time-relaxed travelling tournament problem (K-RTTP) boils down to a double round-xxxxx tournament in a time-relaxed environment (K byes per team) (Xxx & Xxxxx, 2010), characterised by, • a set of n teams T , assume n to be even • a set of timeslots (or rounds) R, with |R| > 2(n− 1) or |R| = 2(n− 1) + K • an n× n integer distance matrix D, where Dij(= Dji) equals the distance between team ti and tj, with ti,j ∈ T : i ƒ= j − − − This means that every team has to play 2(n 1) matches during the competition. The output of the K-RTTP is a feasible double round-xxxxx tournament schedule for n teams, consisting of n(n 1) matches and xX xxxx scheduled over 2(n