| dc.description.abstract | To host a tournament, in addition to the organizer, contestant and venue, the tournament schedule is also an indispensable part. It plans the start time, end time, and the other information for each game. However, scheduling the tournament needs to consider many restrictions, such as the date of the event, the time of the game and the total number of venues. Also, for the fairness of the game, the players need to have enough rest time between the games.
Aiming at the problem of scheduling schedules of events, this paper designs an optimized algorithm that can arrange schedules of events of various sizes with reference to the scheduling results of actual events and the arrangement methods used by experienced scheduling personnel. Taking the rounds in the schedule as the unit, by arranging the sequence of the rounds of the schedule, and then using some coding methods to determine the time and venue of each game to reduce the complexity of scheduling the schedule. Using Genetic Algorithm as the optimization algorithm, with improved replication and mating methods and heuristic mutation methods, the scheduling algorithm can find the most suitable schedules for the needs of the organizers and the result of the scheduling of the event schedule from a large number of competition schedule arrangements.
In order to verify the practical applicability of the proposed method, this thesis used the real events with different days, stadiums and venues to verify the tournament schedules. The experimental results show that all kinds of events can be scheduled similarly or better than real events arranged by experienced personnel. | en_US |