A Heuristic Algorithm for the Mixed Chinese Postman Problem

The Chinese Postman Problem (CPP) is to find a minimum-cost Eulerian tour in a given graph. CPP is efficiently solvable when the original graph is either undirected or directed. For a mixed graph consisting of both edges and arcs, the Mixed Chinese Postman Problem (MCPP) is known to be NP-complete. Many heuristics and optimal algorithms have been devised for solving MCPPs. A new heuristic is proposed. The heuristic finds the initial solution by using a Minimum Cost Flow algorithm; then it repeatedly uses the shortest path algorithm with slightly modified costs of the edges/arcs. The heuristic improves the solution by trying to find the correct direction of unoriented edges and simultaneously it deletes some of the additional edges/arcs. A number of previous heuristics are tested, analyzed, and compared with the proposed approach. Based upon computational results, the proposed heuristic on average outperforms all previous heuristics.

[1]  Wen Lea Pearn,et al.  Improved solutions for the Chinese postman problem on mixed networks , 1999, Comput. Oper. Res..

[2]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[3]  Richard M. Karp,et al.  A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem , 1979, SIAM J. Comput..

[4]  HONG YAN,et al.  Finding Postal Carrier Walk Paths in Mixed Graphs , 1998, Comput. Optim. Appl..

[5]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[6]  Gilbert Laporte,et al.  Modeling and solving several classes of arc routing problems as traveling salesman problems , 1997, Comput. Oper. Res..

[7]  Christos H. Papadimitriou,et al.  On the complexity of edge traversing , 1976, J. ACM.

[8]  Gary Chartrand,et al.  Applied and algorithmic graph theory , 1992 .

[9]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[10]  C. M. Liu,et al.  Algorithms for the Chinese postman problem on mixed networks , 1995, Comput. Oper. Res..

[11]  Martin Grötschel,et al.  A cutting plane algorithm for the windy postman problem , 1992, Math. Program..

[12]  Maurice Queyranne,et al.  On the structure of all minimum cuts in a network and applications , 1982, Math. Program..

[13]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[14]  E. Minieka.  The Chinese Postman Problem for Mixed Networks , 1979 .

[15]  Greg N. Frederickson,et al.  Approximation Algorithms for Some Postman Problems , 1979, JACM.

[16]  Yaxiong Lin,et al.  A new algorithm for the directed chinese postman problem , 1988, Comput. Oper. Res..

[17]  L Levy,et al.  SCHEDULING THE POSTAL CARRIERS FOR THE UNITED STATES POSTAL SERVICE: AN APPLICATION OF ARC PARTITIONING AND ROUTING. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[18]  Ted K. Ralphs,et al.  On the mixed Chinese postman problem , 1993, Oper. Res. Lett..

[19]  R. Burkard,et al.  Assignment and Matching Problems: Solution Methods with FORTRAN-Programs , 1980 .

[20]  Balaji Raghavachari,et al.  Approximation Algorithms for the Mixed Postman Problem , 1998, IPCO.

[21]  Ulrich Derigs,et al.  The Chinese Postman Problem , 1980 .

[22]  Richard W. Eglese,et al.  Efficient Routeing for Winter Gritting , 1992 .

[23]  H. D. Ratliff,et al.  Minimum cuts and related problems , 1975, Networks.

[24]  Moshe Dror,et al.  Routing electric meter readers , 1979, Comput. Oper. Res..

[25]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[26]  P. Toth,et al.  Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .

[27]  Gary J. Koehler,et al.  The mixed postman problem , 1979, Discret. Appl. Math..

[28]  J. Picard,et al.  An optimal algorithm for the mixed Chinese postman problem , 1996 .