Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Logistics Systems and Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
