OTIMIZAÇÃO DE ROTAS DE ENTREGAS DE MATERIAIS EM UMA REDE HOSPITALAR POR MEIO DO ALGORITMO DO PROBLEMA DO CAIXEIRO VIAJANTE.

This work aimed to propose routing options to distribute medical-hospital materials from a central warehouse to 21 hospitals in the State of Minas Gerais. It is an applied study, of quantitative approach, developed in Fundação Hospitalar do Estado de Minas Gerais, the largest network of public hospitals in Latin America. In this way, some models were tested to optimize the deliveries of such items to the units. The aim was to reduce distribution costs by reducing the distances traveled, when using more than one vehicle, with different capacities. An adaptation of the Traveling Salesman Problem was implemented in IBM CPLEX software, presenting routing proposals with variables with index. Routes were obtained using more than one vehicle, attending to all units, obeying the quantitative and the frequencies stipulated by the organization. It has been demonstrated that the adoption of vehicles with greater capacity can optimize the deliveries, reducing the distance traveled by 19%, approximately. We emphasize the importance of this study because it is a network of hospitals, being a differential within the literature of the area. [ABSTRACT FROM AUTHOR]