A new algorithm for the directed chinese postman problem

https://doi.org/10.1016/0305-0548(88)90053-6Get rights and content

Abstract

The directed Chinese Postman Problem can be transformed into a minimum cost flow problem over a derived network, or be transformed into a transportation problem in which the coefficients are determined by a shortest path problem over an extended network. Based on the Complementary Slackness Theorem, this paper will present an algorithm for the directed Chinese Postman Problem, which can be applied directly to the original network and, compared with the existing algorithms, has a better computational complexity O(kn2) where k depends on the structure of the network. The algorithm is extended to the directed m-CPP case.

References (8)

  • E.J. Beltrami et al.

    Networks and vehicle routing for municipal waste collection

    Networks

    (1974)
  • E. Minieka

    The Chinese Postman Problem for mixed networks

    Mgmt Sci.

    (1979)
  • E. Minieka

    Optimization Algorithms for Networks and Graphs

    (1978)
  • J. Edmonds et al.

    Matching, Euler tours and the Chinese Postman

    Math. Progr.

    (1973)
There are more references available in the full text version of this article.

Cited by (23)

  • Time-constrained Chinese postman problems

    2002, Computers and Mathematics with Applications
  • Chapter 5 Arc routing methods and applications

    1995, Handbooks in Operations Research and Management Science
  • A Fleet Management System of Autonomous Electric Street Sweepers

    2023, Proceedings of the 2023 IEEE International Conference on Cybernetics and Intelligent Systems and IEEE Conference on Robotics, Automation and Mechatronics, CIS-RAM 2023
  • Minimum cost Eulerian cycles in road networks

    2022, Iberian Conference on Information Systems and Technologies, CISTI
View all citing articles on Scopus

Yaxiong Lin, currently the Ph.D. student in the Department of Industrial & Management Systems Engineering, Arizona State University, received his B.S. in 1983 and M.S. in 1986 from the Department of Systems Engineering, Shanghai Institute of Mechanical Engineering, Shanghai, China. Research interests include: graph theory, networks, mathematical programming, modeling and simulation. This work was done when he was at Shanghai Institute of Mechanical Engineering.

Yongchang Zhao, professor of the Systems Engineering Research Institute, Shanghai Institute of Mechanical Engineering. Research interests include: graph theory, networks, mathematical programming, circuits & systems, signal flow graph and its applications, transportation planning.

View full text