PLANEJAMENTO DE ROTAS: UM ESTUDO DE CASO EM UMA TRANSPORTADORA DE IMPLEMENTOS AGRÍCOLAS NA REGIÃO METROPOLITANA DE LONDRINA-PR

Abstract

Abstract: Due to increased competitiveness, technological innovations have played a leading role in improving production processes in any company. Regardless of size, whether micro, small, or large, all feel the need for projects aimed at minimizing costs related to the transportation of inputs and goods. Among the tools that simulate process improvement scenarios is Operations Research, and within it, we have a route planning model, also known as the Traveling Salesman Problem. In this problem, it is necessary to start from a starting point, visit a series of locations only once, and then return to the starting point, aiming to cover the shortest distance or the shortest time. This paper presents a case study in an agricultural implement carrier located in the metropolitan region of Londrina, Paraná, which has been operating in the market for the transport of agricultural machines and components for over 11 years. For route planning, a Traveling Salesman Problem model was constructed in the Python programming language, and the IBM-CPLEX solver was used to solve it. The data provided by the company corresponds to five routes that cover most of the national territory. By applying the data to the model and solving it via IBM-CPLEX, it was possible to achieve a reduction of approximately 19.79% in the total distance traveled, considering the three routes, and obtain approximately R$6,360.79 in transportation cost reduction.

Keywords: Operations Research, Traveling Salesman Problem, IBM-CPLEX, Python.