Aplicação do caminho mínimo por meio do algoritmo de Dijkstra em uma transportadora de combustíveis

Abstract

The search for solutions in the transportation industry that reduce fuel consumption, emission of pollutants and operation time grows due to the current Brazilian scenario of increasing diesel prices, concern with the environment and competition in the sector. The Transport Company under analysis is located in the city of Feira de Santana and has been operating in the market since 2018 whose interest in the benefits of route evaluation. Therefore, the objective of this work is to analyze and propose new routes, in the process of product delivery in the Carrier under study, from the application of Dijkstra's algorithm for the determination of the minimum path. The applied methodology followed some steps, such as data collection from the software Bsoft, interview with the Manager for confirmation of the collected data and complement, evaluation of the current route and an alternative according to a heuristic method, use of the Dijkstra algorithm as a tool for analyzing the sequence of product delivery and elaboration of new routes. The results show that with the application of Dijkstra's algorithm and simulation of the minimum path, a new route was obtained with a sequence of unloading in the 4 stations that reduced 1 kilometer of the distance of each trip and resulted in a savings of 192 km and 1025.36 reais per truck per year, besides the benefit of reducing one stop in the delivery route. In conclusion, the proposed methodology proved to be efficient as a new decision making tool for the company.