A Study of Social Sports Scheduling Based on Genetic Algorithm

With the con tinuous develop ment of social s ports, a comp rehensive soc ial s ports project tends to face multiple concurrent projects which will inevitably induce co mpetitions for some of the resources of social sports. This thesis deals with how to reasonably arrange the start time of these activities while meeting various constraint conditions to obtain the entire project scheduling and to minimize the total duration of t he proj ects’ occupancy for social sp orts resources. Comb ined with the simula ted annealing a lgorithm, sche duling a lgorithm for t he s ocial sports project i s desi gned to study t he problem of social sports scheduling. It is confirmed through practice that the genetic algorithm enjoys a g ood application prospec t in t he ac tual work an d i t can be widely a pplied b ecause of its fast calculation and its easy integration into the software system.