Metaheuristics Algorithm In Sorting Sports Events

Sorting sports events is a combinatorial optimization problem. It's unlikely to traverse the whole resolution space for the huge player population and complexity of events they involved. For such kind of problems, Using Metaheuristics algorithm normally will be more efficient.This paper shortly describes the history and category of Metaheuristics optimization algorithms. Then gives a detailed introduction to two most well-known Metaheuristics algorithms: Genetic algorithm and Tabu search. The paper establishes a combinatorial optimization model for the sorting sports events problem and constructs a high efficient searching algorithm according to the features of Genetic algorithm and Tabu search.This paper realizes the whole algorithm in Matlab platform and uses it on a sports meeting data sample. We also compare the computing procedures using different parameter values. From the result, we find that this algorithm is efficient for approaching the optimization solution in a fixed time.