Construction of a TTP Schedule Sample Clauses

Construction of a TTP Schedule. ‌ The discussed algorithms all require the initialisation or the construction of a schedule. The move operators will then be performed on this initial schedule. Trick (2000) proposes a multiphase approach for the construction of sports timetables and defines three separate subproblems. Finding home-away patterns (HAPs) for all n teams in a competition can be considered as a first subproblem. This consists of finding a set of n strings of pluses and minuses that correspond to the home and away sequence of a team. Trick (2000) defines the construction of a basic match schedule (BMS) as a second subproblem. Constructing this BMS consists out of assigning games to the HAPs that where proposed in the first subproblem. The basic match schedule is actually a schedule with generic teams. The third subproblem consists of changing these generic teams into real teams, which then completes the timetable. The alternative approaches in sports timetable generation mainly differ in the order in which these subproblems are being tackled. In general, the more critical a decision is perceived the earlier it will be made. The second and third subproblem can also be considered as one by immediately using real teams in developing a schedule. The order of the two remaining subproblems is dependent on the importance the researchers assign to the individual subproblems. Xxxxxxx and Xxxxx (1994) propose a first-break-then-schedule approach, i.e. they first generate home-away patterns and then they assign teams to these patterns. Trick (2000) proposes a first-schedule-then-break approach, which reverses the order of these subproblems. A first phase fixes the opponents for all rounds. The resulting schedule can be called the opponent schedule, in which each team is represented by a different integer. In a second phase, the decision about the venue of every match in every round is made. This will result in the home-away assignment for the opponent schedule. This assignment respects the opponent schedule and decides for every game which of the two competing teams will play at home (+) and which team will play an away game (-). This results in a complete schedule of a round-xxxxx tournament. The second phase of the first-schedule-then-break approach can also be seen as a new optimisation problem. Xxxxxxxxx and Xxxxx (2006) define this problem as the timetable constrained distance minimisation problem (TCDMP). For a given timetable of a double round-xxxxx tournament with n teams, an n n ...