Otimização de rotas para a entrega de correspondências

Abstract

The present work aims to present and implement the algorithm of the Chinese Postman Problem (CPP), which consists of determining a minimum path that starts at some vertex of the graph, passes through all the edges at least once and returns to the initial vertex of it. To contextualize this problem, the route of a postman in a neighborhood in Bandeirantes city, western Paraná, was used to optimize the route traveled by him. A study on the theory of graphs and the problem of the Chinese postman according to its variations was previously carried out. Excel, LINDO, DEV-C++ and Xpress software was used to implement the Non-Directed Chinese Postman algorithm. The developed algorithm was applied in the real problem of correspondence delivery and also in the example of Problems of the Konigsberg Bridges