Browse > Article
http://dx.doi.org/10.7236/JIWIT.2012.12.1.133

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)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.12, no.1, 2012 , pp. 133-140 More about this Journal
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.
Keywords
hortest Path; Dijkstra Algorithm; GPS Navigation System; Out-Neighbourhood; Tree Level;
Citations & Related Records
연도 인용수 순위
  • Reference
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.   DOI
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.   DOI
12 K. S. Lee, "Shortest Path Algorithm," http://www. geocities.com/leekinseng1/, 2008.