Vehicle Routing: Application of Travelling Salesman Problem in a Dairy

Abstract

In the logistics context, the physical distribution is the responsibility of delivery of the correct products, to the exact locations and in the ideal moment, so that the expectation of the level of service is met and the transportation costs are minimized. For this, it is essential that structured routing plans are employed. Thus, this article aims to establish an efficient routing configuration for the delivery of milk and fermented dairy beverages. To create a structured routing plan, it was adopted the Traveling Salesman Problem. Due to a large number of variables analyzed, the Nearest Neighbor Algorithm was applied. Following, clusters that encompass the points closest to each other were determined and transformed into daily routes. The new plan proposed results in a reduction of approximately 3,316.2 kilometers per month. In this way, the proposed route plan will entail logistics efficiency as well as the reduction of company costs.