Otimização de rotas através de heurísticas aplicadas a uma competição esportiva

Abstract

Some harmful factors faced while planning events include elevated costs, large displacements, fatigued teams due to long distance travels, as well as the risks going through dangerous paths. With these problems as a basis, the present work sought a way of solving it through a computational method in order to reduce displacements by teams in sports competitions, especially amateur competitions with less financial resources, providing benefits to all teams involved. By way of illustration, experiments were carried out with data relating to teams from a state competition for qualifications were proposed for competition. Defined the problem, a literature review was elaborated for better understanding of the usable concepts in the described problem, which, from the operational search concepts, heuristic methods were applied to an algorithm with the objective of minimizing routes. The results of the experiments indicated differences between the distances of the different proposed competition structures. Finally, the results were verified and reductions were found in the average distances per team with the application of heuristic methods in 38.02% and 63.42% in two competition structures using the Heuristic method by Random Selection. In addition, it is worth highlighting the reduction and in the average amplitude distances by competition structure, being reduced from 2536 to 1527.5 kilometers and from 4887 to 1745.5 from the Initial Solution Methods to the Solution Method by Random Selection, respectively.