The Journal of the Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회논문지)

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

A Point-to-Point Shortest Path Algorithm Based on Level Node Selection

레벨 노드 선택 기반 점대점 최단경로 알고리즘

  • Lee, Sang-Un (Dept. of Multimedia Engineering, Science-Technology, Gangneung-Wonju National University)
  • 이상운 (강릉원주대학교 멀티미디어공학과)
  • Received : 2012.01.02
  • Accepted : 2012.02.10
  • Published : 2012.02.29
Download PDF
⟨ Previous Next ⟩

Abstract

This paper suggests an algorithm that can shorten the complexity $O(n^2)$ of Dijkstra algorithm that is applied to the shortest path searching in real-time GPS Navigation System into an up-to-date O(n). Dijkstra algorithm manipulates the distance of the minimum length path by visiting all the nodes from the starting node. Hence, it has one disadvantage of not being able to provide the information on the shortest path every second, in a city that consists of sophisticated roads, since it has to execute number of node minus 1. The suggested algorithm, firstly, runs by means of organizing the set of out-neighbourhood nodes at each level of the tree, and root node for departure node. It also uses a method of manipulating the distance of the minimum path of all out-neighborhoods and interior of the out-neighborhoods. On applying the suggested algorithm to two sophisticated graphs consisted of bi-direction and uni-direction, we have succeeded to obtain the distance of the minimum length path, just as same as Dijkstra algorithm. In addition, it has an effect of shortening the time taken 4 times from number of node minus1 to number of level minus 1. The satisfaction of the drivers can be increased by providing the information on shortest path of detour, every second, when occurs any rush hour or any traffic congestion due to car accident, by applying this suggested algorithm to the real-time GPS system.

본 논문은 실시간 GPS 항법시스템에서 최단경로 탐색에 일반적으로 적용되고 있는 Dijkstra 알고리즘의 수행 복잡도 $O(n^2)$을 선형인 O(n)으로 단축시킬 수 있는 알고리즘을 제안하였다. Dijkstra 알고리즘은 출발 노드부터 시작하여 모든 노드를 방문하여 최소 경로 길이를 계산한다. 따라서 "노드 수 -1"회를 수행하야 하기 때문에 복잡한 도로로 구성된 도시에서 실시간으로 최단경로 정보를 제공할 수 없는 경우도 발생한다. 제안된 알고리즘은 먼저, 그래프를 트리로, 출발 노드를 근 노드로 치환하여 트리의 각 레벨에 해당하는 외부근방 (Out-Neighbourhood) 노드 집합을 구성하고, 외부근방간과 외부근방 내부의 최소 경로 길이를 계산하는 방법을 적용하였다. 제안된 알고리즘을 양방향과 일방통행로로 구성된 복잡한 2개 그래프에 대해 알고리즘을 적용한 결과 Dijkstra 알고리즘과 동일하게 모든 노드의 최소 경로 길이를 얻는데 성공하였다. 또한, 알고리즘 수행속도를 "노드 수 -1"회에서 "레벨 수 -1"회로 약 4배 정도 단축시키는 효과를 얻었다. 제안된 알고리즘을 GPS 실시간 시스템에 적용하여 러시아워나 차량 사고로 인한 병목현상이 발생하였을 때, 최단 경로 우회 도로 정보를 실시간으로 제공할 수 있다면 운전자의 만족도를 크기 향상시킬 수 있을 것이다.

Keywords

References

  1. M. Abboud, L. Mariya, A. Jaoude, and Z. Kerbage, "Real Time GPS Navigation System," 3rd FEA Student Conference, Department of Electrical and Computer Engineering, American University of Beirut, 2004.
  2. T. H. Cormen, C. E. Leserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms," 2nd Edition, MIT Press and McGraw-Hill, 2001.
  3. E. W. Dijkstra, "A Note on Two Problems in Connection with Graphs," Numerische Mathematik, Vol. 1, pp. 269-271, 1959. https://doi.org/10.1007/BF01386390
  4. Wikipedia, "Dijkstra's Algorithm," http://en.wikipedia.org/wiki/Dijkstra_algorithm, Wikimedia Foundation Inc., 2007.
  5. J. Misra, "A Walk Over the Shortest Path: Dijkstra's Algorithm Viewed as Fixed-Point Computation," Department of Computer Science, University of Texas at Austin, USA, 2000.
  6. Y. T. Lim and H. M. Kim, "A Shortest Path Algorithm for Real Road Network Based on Path Overlap," Department of Civil Engineering, Institute of Transportation Studies, University of California, Irvine, USA, http://www.its.uci.edu/-hyunmyuk/library/(2005) 20EAST(k-path).pdf, 2005.
  7. F. B. Zhan, "Three Fatest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures," Journal of Geographic Informaton and Decision Analysis, Vol. 1, No. 1, pp. 69-82, 1997.
  8. J. Bang-Jensen and G. Gutin, "Digraphs: Theory, Algorithms and Applications," Springer-Verlag, London, 2006.
  9. Wikipedia, "Glossary of Graph Theory," http://en.wikipedia.org/wiki/Glossary_of_grapg_theory, Wikimedia Foundation Inc., 2007.
  10. WWL. Chen, "Discrete Mathematics," Department of Mathematics, Division of ICS, Macquarie University, Australia, http://www.maths.mq.edu.au/-wchen/lndmfolder/lndm.html, 2003.
  11. R. C. Prim, "Shortest Connection Networks and Some Generalisations," Bell System Technical Journal, Vol. 36, pp. 1389-1401, 1957. https://doi.org/10.1002/j.1538-7305.1957.tb01515.x
  12. K. S. Lee, "Shortest Path Algorithm," http://www. geocities.com/leekinseng1/, 2008.

Cited by

  1. A Point-to-Point Shortest Path Search Algorithm in an Undirected Graph Using Minimum Spanning Tree vol.19, pp.7, 2014, https://doi.org/10.9708/jksci.2014.19.7.103