Publicação
Metaheuristic strategies for solving scheduling problems for gymnastics competitions
| datacite.subject.fos | Departamento de Informática | pt_PT |
| dc.contributor.advisor | Falcão, André Osório e Cruz de Azerêdo, 1969- | |
| dc.contributor.author | Nande, Inês Filipa da Silva Furtado | |
| dc.date.accessioned | 2024-04-15T16:43:52Z | |
| dc.date.available | 2024-04-15T16:43:52Z | |
| dc.date.issued | 2024 | |
| dc.date.submitted | 2023 | |
| dc.description | Tese de mestrado, Ciência de Dados, 2023, Universidade de Lisboa, Faculdade de Ciências | pt_PT |
| dc.description.abstract | The positioning of teams regarding acrobatic gymnastics can become a challenge considering the complexity of the sport and the restrictions needed for a fair and adequate championship. Competition schedules are organized by blocks that symbolize the interval in the calendar where a predefined set of teams with the same characteristics will act. The starting order defines the positioning of teams in each block. This thesis portrays the research, development, and application of an algorithm that generates an admissible solution for assigning teams in the starting order, explore the hypothesis of generating solutions with hard and soft constraints to provide an admissible solution. Initially, the problem was formalized through theoretical research. Posteriorly, interviews were carried out with judges, athletes, and championship organizers to determine the associated hard and soft constraints. These will define whether or not a starting order is admissible. Due to the type of problem and the complexity of the associated constraints, different types of metaheuristics were tested, specifically local search and evolutionary algorithms. The following methods were selected for implementation: Hill-Climbing (the baseline), Simulated Annealing, and Genetic Algorithm. These models underwent a testing phase in different types of competitions, and computational complexity was also analyzed. Solutions were explored and compared between strategies. Results show that local search methods can modulate different types of schedules in a reasonable amount of time, with the simulated annealing technique providing the best results. | pt_PT |
| dc.identifier.tid | 203683420 | |
| dc.identifier.uri | http://hdl.handle.net/10451/64279 | |
| dc.language.iso | eng | pt_PT |
| dc.subject | Otimização | pt_PT |
| dc.subject | Hill Climbing | pt_PT |
| dc.subject | Simulated Annealing | pt_PT |
| dc.subject | Algoritmo Genético | pt_PT |
| dc.subject | Metaheurísticas | pt_PT |
| dc.subject | Teses de mestrado - 2024 | pt_PT |
| dc.title | Metaheuristic strategies for solving scheduling problems for gymnastics competitions | pt_PT |
| dc.type | master thesis | |
| dspace.entity.type | Publication | |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | masterThesis | pt_PT |
| thesis.degree.name | Tese de mestrado em Ciência de Dados | pt_PT |