Modelamiento de distribución de productos cárnicos como un TSP (Traveling Salesman Problem) con teoría de grafos

This paper has as its main objective of use the TSP (Traveling Salesman Problem) with graph theory in order to design routing strategies in a distribution network, looking for an efficient way to be made in regard to distance and time used for attending customer’s requirements. Additionally, the paper develops a case of application of the methodology in a Meat Company located in the city of Medellin. As a result, we find that the use of TSP with graph produces a route with the minimum distance in the distribution network; it was demonstrated in the case of application.