Browse > Article
http://dx.doi.org/10.9708/jksci.2014.19.7.103

A Point-to-Point Shortest Path Search Algorithm in an Undirected Graph Using Minimum Spanning Tree  

Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
Publication Information
Journal of the Korea Society of Computer and Information / v.19, no.7, 2014 , pp. 103-111 More about this Journal
Abstract
This paper proposes a modified algorithm that improves on Dijkstra's algorithm by applying it to purely two-way traffic paths, given that a road where bi-directional traffic is made possible shall be considered as an undirected graph. Dijkstra's algorithm is the most generally utilized form of shortest-path search mechanism in GPS navigation system. However, it requires a large amount of memory for execution for it selects the shortest path by calculating distance between the starting node and every other node in a given directed graph. Dijkstra's algorithm, therefore, may occasionally fail to provide real-time information on the shortest path. To rectify the aforementioned shortcomings of Dijkstra's algorithm, the proposed algorithm creates conditions favorable to the undirected graph. It firstly selects the shortest path from all path vertices except for the starting and destination vertices. It later chooses all vertex-outgoing edges that coincide with the shortest path setting edges so as to simultaneously explore various vertices. When tested on 9 different undirected graphs, the proposed algorithm has not only successfully found the shortest path in all, but did so by reducing the time by 60% and requiring less memory.
Keywords
Undirected graph; Shortest path; Dijkstra algorithm; GPS navigation system; Point-to-point search;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
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 Connexion with Graphs," Numerische Mathematik, Vol. 1, No. 1, pp. 269-271, 1959.   DOI   ScienceOn
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 W. W. L. Chen, "Discrete Mathematics, " Department of Mathematics, Division of ICS, Macquarie University, Australia, 2003.
7 F. B. Zhan, "Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures," Journal of Geographic Information and Decision Analysis, Vol. 1, No. 1, pp. 69-82, Feb. 1997.
8 R. C. Prim, "Shortest Connection Networks and Some Generalisations," Bell System Technical Journal, Vol. 36, pp. 1389-1401, Nov. 1957.   DOI
9 S. U. Lee, "A Point-to-Point Shortest Path Search Algorithm for Digraph," Journal of Korean Institute of Intelligent Systems, Vol. 17, No. 7, pp. 893-900, Dec. 2007.   과학기술학회마을   DOI   ScienceOn
10 S. U. Lee, "A Point-to-Point Shortest Path Algorithm Based on Level Node Selection, " Journal of the Institute of Internet, Broadcasting and Communication, Vol. 12, No. 1, pp. 133-140, Feb. 2012.   과학기술학회마을   DOI   ScienceOn
11 S. U. Lee, "A Real-time Point-to-Point Shortest Path Search Algorithm Based on Traveling Time," Journal of the Institute of Internet, Broadcasting and Communication, Vol. 12, No. 4, pp. 131-140, Aug. 2012.   과학기술학회마을   DOI   ScienceOn
12 C. Peiper, CS 400-Data Structures for Non CS-Majors," http://www.cs.uiuc.edu/class/fa05/cs400/_labs/Lab12/suuri/, 2005.
13 O. Boruvka, "O Jistem Problemu Minimalnim, " Prace Mor. Prrodved. Spol. V Brne (Acta Societ. Natur. Moravicae), Vol. III, No. 3, pp. 37-58, 1926.
14 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, No. 1-3, pp. 3-36, Apr. 2001.   DOI   ScienceOn
15 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, 2005.
16 R. Wenger, "CIS 780: Analysis of Algorithms," http://www.cse.ohio-state.edu/-wenger/cis780/shortest_path.pdf, 2004.
17 Y. T. Lim and H. M. Kim, "A Shortest Path Algorithm for Real Road Network Based on Path Overlap," Journal of the Eastern Asia Society for Transportation Studies, Vol. 6, pp. 1426-1438, 2005.