Simulação de rotas para a distribuição de urnas eletrônicas no município de São Paulo, utilizando algoritmo genético

• Autor(a) principal: Alves, Hugo de Oliveira
• Data de Publicação: 2023
• Tipo de documento: Trabalho de conclusão de curso
• Idioma: por
• Título da fonte: Repositório Institucional da UTFPR (da Universidade Tecnológica Federal do Paraná (RIUT))
• Texto Completo: http://repositorio.utfpr.edu.br/jspui/handle/1/33717
• topic: Algoritmos Genéticos; Metaheurísticas; Problema de roteamento de veículos; Genetic algorithms; Metaheuristics; Vehicle routing problem; CNPQ::ENGENHARIAS::ENGENHARIA DE PRODUCAO

The present work aimed to improve the vehicle routing process for the distribution of electronic voting machines to the electoral zones of the municipality of São Paulo, through a case study. The research was developed from data collection, regarding the respective addresses of the electoral zones located in the analyzed municipality. In total, 58 distinct addresses were collected, which were related within a distance matrix. This matrix was organized to relate the distances between all collected addresses and served as the basis for implementing the algorithm proposed in this study. The objective of the algorithm was to simulate a set of routes that would minimize the total distance traveled to serve all necessary distribution points. For this, a computer code was developed through the structure of a genetic algorithm, programmed from the Python language, using the Pycharm IDE (Integrated Development Environment). In addition, the computational tool MS-Excel® was also used for comparison purposes of the solutions. Finally, the results obtained are presented, demonstrating the efficiency and possible applicability of the proposed algorithm in the research.