Métodos para construção de rotas eulerianas em grafos mistos com aplicação na distribuição de bens e serviços.

Abstract

The main objective of this study is the development of methods that solve the Chinese Postman Problem in mixed graphs, aiming at direct applications in the distribution of public goods and services. Due to these applications, some restrictions associated with traffic laws and vehicle maneuvers have been raised when these are necessary. We present solutions that adapt these restrictions to the algorithms to the final route. The original graph is modified through heuristic procedures, which transform it into an Eulerian graph, where the Final Route will be applied. All the algorithms, related to these procedures and the final route, are presented in a structured way, facilitating their comprehension and implementation. At the end some aspects that can be embroidered in the future are presented, aiming at a better adaptation of the work to the real problem.