Chinese Postman Problem (CPP): solution methods and computational time

This paper proposes an algorithm to choose suitable methods to solve the Chinese Postman Problem (CPP). This study also concerns CPP computational time analysis, aiming to determine whether optimising methods can be used to solve real CPP instances with minimal computational time (polynomial time). The algorithm proposed is based on a literature review of the CPP. Regarding computational time analysis, two case studies were performed in a medium-sized city in Brazil. In addition, it was shown that for real problems (200 nodes) no significant differences exist between the computational time of the mathematical solutions for undirected, directed and mixed problems.