Advanced SearchSearch Tips
An Eulerian Cycle Algorithm for Chinese Postman Problem
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
An Eulerian Cycle Algorithm for Chinese Postman Problem
Lee, Sang-Un;
  PDF(new window)
This paper introduces an algorithm to construct an Eulerian cycle for Chinese postman problem. The Eulerian cycle is formed only when all vertices in the graph have an even degree. Among available algorithms to the Eulerian cycle problem, Edmonds-Johnson`s stands out as the most efficient of its kind. This algorithm constructs a complete graph composed of shortest path between odd-degree vertices and derives the Eulerian cycle through minimum-weight complete matching method, thus running in . On the contrary, the algorithm proposed in this paper selects minimum weight edge from edges incidental to each vertex and derives the minimum spanning tree (MST) so as to finally obtain the shortest-path edge of odd-degree vertices. The algorithm not only runs in simple linear time complexity but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.
Chinese postman problem;Eulerian cycle;Degree;Minimum Weighted edge;
 Cited by
R. C. Larson and A. R. Odoni," Urban Operations Research: Logistical and Transportation Planning Methods," Messachusetts Institute of Technology, Prentice-Hall, 1981.

B. Kallehauge, J. Larsen, and O. B. G. Madsen, "Largrangean Duality Applied on Vehicle Routing with Time Windows: Experimental Results," Technical University of Denmark, 2001.

Wikipedia, "Hamiltonian Path Problem,", Wikimedia Inc., 2016.

Wikipedia, "Eulerian Path,", Wikimedia Inc., 2016.

G. Hasle, "Vehicle Routing and Traveling Salesperson Problems," Department of Optimization, SINTEF Applied Mathematics, Oslo, Norway, 2002.

T. V. Hoai, "Vehicle Routing Problem: General Problem for TSP," Faculty of Computer Science and Engineering, Ho Chi Minh University of Technology, 2008.

D. Ahr, "Contributions to Multiple Postmen Problems," Institute of Computer Science University of Heidelberg, 2004.

A. Osterhues and F. Mariak, "On Variants of the k-Chinese Postman Problem," Universitat Dormund, Operations Research und Wirtshaftsinformatik, Vogelporthweg, Dormund, Germany, 2005.

S. U. Lee, "The Extended k-opt Algorithm for Traveling Salesman Problem," Journal of KSCI, Vol. 17, No. 10, pp. 155-165, Oct. 2012.

S. U. Lee, "A Polynomial Time Algorithm of a Traveling Salesman Problem," Journal of KSCI, Vol. 18, No. 12, pp. 75-82, Dec. 2013.

O. Boruvka, "O Jistem Problemu Minimalnim," Prace Mor. Prrodved. Spol. V Brne (Acta Societ. Natur. Moravicae), Vol. III, No. 3, pp. 37-58, 1926.

J. Nesetril, E. Milkova, and H. Nesetrilova, "Otakar Boruvka on Minimum Spanning Tree Problem (Translation of the both 1926 Papers, Comments, History)," DMATH: Discrete Mathematics, Vol. 233, 2001.

D. Bricker, "The Chinese Postman Problem," Department of Industrial Engineering, University of Iowa, 2000. reference: H. A. Eiselt, M. Gendreau, and G. Laporte, "Arc Routing Problems, Part 1: The Chinese Postman Problem," Operations Research, Vol. 43, pp. 231-242, 1995. crossref(new window)