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

Authors: Moacir Godinho Filho, Rogerio de Avila Ribeiro Junqueira

Addresses: Industrial Engineering Department, Federal University of Sao Carlos, Rod. Washington Luis, Km 235, 13565-905, Sao Carlos – SP – Brazil. ' Industrial Engineering Department, Federal University of Sao Carlos, Rod. Washington Luis, Km 235, 13565-905, Sao Carlos – SP – Brazil

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.

Keywords: logistics; CPP; Chinese postman problem; solution method choice; computational time analysis; case study; Brazil.

DOI: 10.1504/IJLSM.2010.035038

International Journal of Logistics Systems and Management, 2010 Vol.7 No.3, pp.324 - 344

Published online: 01 Sep 2010 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article