INSPECTUS: ferramenta de otimização de rotas para inspeção de aeródromos rurais utilizando o problema do caixeiro viajante
- Welber Simões de Souza
- Danielle Silva Marques Simões
- Evandro José da Silva
Instituto Tecnológico de Aeronáutica
- Event
- XXII SITRAER – Brasília, DF, Brasil, October 22–24, 2025
- Volume
- Anais do XXII Simpósio de Transporte Aéreo – SITRAER 2025 · ISBN 978-65-272-2024-4 · DOI 10.29327/9786527220244
- Publisher
- Even3 Publicações
- Editors
- Fabiana Serra de Arruda, Camila Lucena, Giovanna Miceli Ronzani Borille, Evandro José da Silva
Resumo
This paper presents the development of a computational tool designed to optimize inspection routes for rural aerodromes in Brazil, focusing on logistical streamlining, cost reduction, and operational efficiency in field supervision. The proposed methodology is grounded in the classical Traveling Salesman Problem (TSP), addressed through the Christofides heuristic, which provides high-quality approximate solutions with computational efficiency. The tool, named INSPECTUS, was implemented in Python using the Google Colab environment and integrates Google Maps APIs to accurately estimate road travel distances and durations between aerodromes. The system automates the entire process, from data input to the generation of technical PDF reports containing operational parameters, geographical visualization of the optimized route, and cost breakdowns per inspection leg. This approach proves particularly beneficial for regulatory bodies and technical teams responsible for supervising airport infrastructure in remote areas, where connectivity and transport options are limited. The results confirm the applicability of the tool in real-world scenarios, demonstrating its flexibility and scalability, as well as its potential for future integration with more advanced metaheuristic methods.
Palavras-chave: Traveling Salesman Problem (TSP; Christofides Heuristic; Aerodrome Inspection; Route Optimization; Airport Infrastructure Planning