Move Operators Clause Samples

Move Operators. ‌ A move operator is defined as a mechanism that performs a certain move or change to an existing schedule in order to create a new schedule, which will also be part of the search space. This search space is defined as the set of schedules that can be obtained by applying any linear combination of move operators on any member of this set. All schedules that are part of the search space comply with the the first 3 constraints (C1, C2 and C3) of Section 2.1, later defined as the hard constraints. Schedules in the search space can violate the last 2 contraints (the atmost and norepeat constraint) of Section 2.1, later defined as soft constraints. The solution space of this dissertation is defined as the subset of the search space containing the schedules that comply with all five constraints of Section 2.1, members of the solution space will be called feasible schedules. For the time-constrained travelling tournament problem, ▇▇▇▇▇▇▇▇▇▇▇▇▇▇▇, ▇▇▇▇▇▇, ▇▇▇ ▇▇▇▇▇▇▇▇▇▇, and Vergados (2006) have defined five basic move operators. These five operators, or a selection of them, are implemented in more than six methods that were created to tackle the TTP. When performing some minor alterations to these operators, they can also be implemented in RTTP-solving algorithms (Section 3.4.1).