Proceedings of the Korean Operations and Management Science Society Conference (한국경영과학회:학술대회논문집)
- 2002.05a
- /
- Pages.8-14
- /
- 2002
A Study on New Algorithm for K Shortest Paths Problem
복수최단경로의 새로운 해법 연구
-
Chang ByungMan
(Seoul National University of Technology)
-
장병만
(서울산업대학교 산업정보시스템공학과)
- Published : 2002.05.01
Abstract
This article presents a new algorithm for the K Shortest Paths Problem which develops initial K shortest paths, and repeal to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution which comprises K shortest paths among shortest paths to traverse each arc is made from bidirectional Dijkstra algorithm. When a crossing node that have two or more inward arcs is found at least three time by turns in this K shortest paths, one inward arc of this crossing node, which has minimum detouring distance, is chosen, and a new path is exposed with joining a detouring subpath from source to this inward arc and a spur of a feasible path from this crossing node to sink. This algorithm, requires worst case time complexity of
Keywords