Thesis Propuesta de framework metaheurístico para la resolución del traveling tournament problem enfocado en el fútbol
No Thumbnail Available
Date
2024
Authors
Journal Title
Journal ISSN
Volume Title
Program
Ingeniería Civil Informática
Departament
Campus
Campus Santiago San Joaquín
Abstract
En este trabajo se desarrolló un framework metaheurístico para resolver el Traveling Tournament Problem con el objetivo de calendarizar la English Premier League y la Primera División Chilena. Resolver este problema permite aumentar la calidad de un torneo y por ende, su atractivo. Las dos técnicas implementadas para resolver el problema corresponden a variantes de Tabu Search y Simulated Annealing, las cuales son los métodos de búsqueda incompleta más utilizados en la literatura. Los parámetros de ambos algoritmos se sintonizaron utilizando el paquete irace de R. Se calendarizaron las temporadas 13/14 y 23/24 de la English Premier League junto con la 2024 de la Primera División Chilena empleando ambas técnicas propuestas. En los mejores casos, se obtuvieron resultados cercanos a los de la literatura. Los resultados obtenidos, muestran que la versión propuesta de Tabu Search obtuvo un mejor desempeño en comparación con Simulated Annealing.
This work proposes the use of a developed metaheuristic framework to solve the Traveling Tournament Problem. Having a good fixture, is crucial to improve the quality of a tournament, which leads it to being more attractive. The football leagues that will be schedule are the English Premier League and Primera División Chilena. The two metaheuristic used to achive this goal are a Tabu Search and Simulated Annealing based technics, these are the most used incomplete search methods to solve this problem. Parameter tunning for the proposed algorithms was carried out using the R package irace. The scheduled seasons of the EPL were the 13/14 and 23/24, as long as for the PDC, the scheduled season was the 2024. For both leagues, the two proposed algorithms were use for scheduling. The best results achived were close to the ones presented in the literature. For each league, the outcomes showed that the Tabu Search based technic had a better performance than Simulated Annealing.
This work proposes the use of a developed metaheuristic framework to solve the Traveling Tournament Problem. Having a good fixture, is crucial to improve the quality of a tournament, which leads it to being more attractive. The football leagues that will be schedule are the English Premier League and Primera División Chilena. The two metaheuristic used to achive this goal are a Tabu Search and Simulated Annealing based technics, these are the most used incomplete search methods to solve this problem. Parameter tunning for the proposed algorithms was carried out using the R package irace. The scheduled seasons of the EPL were the 13/14 and 23/24, as long as for the PDC, the scheduled season was the 2024. For both leagues, the two proposed algorithms were use for scheduling. The best results achived were close to the ones presented in the literature. For each league, the outcomes showed that the Tabu Search based technic had a better performance than Simulated Annealing.
Description
Keywords
Traveling tournament problem, Calendarización, Fútbol, Primera División Chilena
