Otimização de rotas do transporte escolar público em Russas/CE: uma abordagem com programação linear inteira

Abstract

This paper presents an approach to optimizing public school transport routes in the city of Russas/CE, using Integer Linear Programming (ILP). The main objective was to minimize the distance traveled by school buses, ensuring operational efficiency. To do this, the routes currently used by the city were mapped and a mathematical model was developed to find the shortest and most efficient routes. The problem was modeled as a variation of the Traveling Salesman Problem (TSP), with specific constraints to ensure the feasibility of the solution. The implementation of the model enabled the obtaining of optimized routes. The results showed that the optimization led to a significant reduction in the distances traveled: Route 1 had a reduction of 2.28 km (an optimization of 19.79%) and Route 2 had a reduction of 3.03 km (an optimization of 20.23%). These improvements have a direct impact on the efficiency of school transportation, reducing the distance students travel and operating costs. The results of this study reinforce the importance of applying optimization techniques to the management of public school transport, providing a more agile service for the municipality