CPP의 오일러 사이클 알고리즘
An Eulerian Cycle Algorithm for Chinese Postman Problem
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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 log but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.
Abstract
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 log but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.
참고문헌 (14)
- R. C. Larson, "Urban Operations Research: Logistical and Transportation Planning Methods" (1981), Prentice-Hall
- B. Kallehauge, "Largrangean Duality Applied on Vehicle Routing with Time Windows: Experimental Results" (2001), Technical University of Denmark
- "Hamiltonian Path Problem" (2016)[URL]
- "Eulerian Path" (2016)[URL]
- G. Hasle, "Vehicle Routing and Traveling Salesperson Problems" (2002), SINTEF Applied Mathematics
- T. V. Hoai, "Vehicle Routing Problem: General Problem for TSP", pp.2008
- D. Ahr, "Contributions to Multiple Postmen Problems", pp.2004
- On Variants of the k-Chinese Postman Problem, "A. Osterhues", Universitat Dormund, ~ (2005)
- 이상운, "외판원 문제의 확장된 k-opt 알고리즘", 한국컴퓨터정보학회논문지, 17(10), pp.155~165 (2012), 한국컴퓨터정보학회
- 이상운, "외판원 문제의 다항시간 알고리즘", 한국컴퓨터정보학회논문지, 18(12), pp.75~82 (2013), 한국컴퓨터정보학회
- O. Borůvka, "O Jistem Problemu Minimalnim", Prace Mor. Prrodved. Spol. V Brne (Acta Societ. Natur. Moravicae), Ⅲ(3), pp.37~58 (1926)
- J. Nešetřil, "Otakar Borůvka on Minimum Spanning Tree Problem (Translation of the both 1926 Papers, Comments, History)", DMATH: Discrete Mathematics, 233 (2001)
- D. Bricker, "The Chinese Postman Problem", pp.2000
- H. A. Eiselt, "Arc Routing Problems, Part 1 : The Chinese Postman Problem", Operations Research, 43, pp.231~242 (1995)