Chinese Postman Problem (CPP): solution methods and computational time
by Moacir Godinho Filho, Rogerio de Avila Ribeiro Junqueira
International Journal of Logistics Systems and Management (IJLSM), Vol. 7, No. 3, 2010

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.

Online publication date: Wed, 01-Sep-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com