Print version ISSN 0103-6513
GODINHO FILHO, Moacir and JUNQUEIRA, Rogério de Ávila Ribeiro. Chinese Postman Problem: solution methods choice and computational time analysis. Prod. [online]. 2006, vol.16, n.3, pp. 538-551. ISSN 0103-6513. http://dx.doi.org/10.1590/S0103-65132006000300014.
This work deals with Chinese Postman Problem (CPP). First, this paper, based on structuring and analyzing a CPP literature review, proposes an algorithm to help choosing suitable methods to solve CPP. The proposed algorithm is used on two real-world cases. This paper also verifies if in real urban logistics cases it is valid the assumption that the obtaining the optimal solution for the mixed 1 vehicle CPP is more difficult than directed and undirected cases. To accomplish this goal real-world cases are selected (household refuse collection and postal service). This work concludes that for real-world situations there are no significant differences on computational time between directed, undirected and mixed CPP.
Keywords : Logistics; Chinese Postman Problem; solution procedure choice; computational time.