Methods for finding shortest paths on graphs in organizational and economic systems and their implementation

With the availability and accuracy of satellite-based positioning systems and the growing computational power of mobile devices, recent research and commercial products of navigation systems are focusing on incorporating real-time information for supporting various applications. In addition, for routing purposes, navigation systems implement many algorithms related to path finding (e.g., shortest path search algorithms). This chapter presents the foundation and state-of-the-art development of navigation systems and reviews several spatial query related algorithms.

Download Full-text

Modern Navigation Systems and Related Spatial Query

Handbook of Research on Geoinformatics ◽

10.4018/978-1-59140-995-3.ch036 ◽

2010 ◽

pp. 285-292

Author(s):

Wei-Shinn Ku ◽

Haojun Wang ◽

Roger Zimmermann

Keyword(s):

Shortest Path ◽

Search Algorithms ◽

Navigation Systems ◽

Computational Power ◽

Spatial Query ◽

Positioning Systems ◽

Path Search ◽

Real Time Information ◽

Shortest Path Search ◽

Time Information

With the availability and accuracy of satellite-based positioning systems and the growing computational power of mobile devices, recent research and commercial products of navigation systems are focusing on incorporating real-time information for supporting various applications. In addition, for routing purposes, navigation systems implement many algorithms related to path finding (e.g., shortest path search algorithms). This chapter presents the foundation and state-of-the-art development of navigation systems and reviews several spatial query related algorithms.

Download Full-text

EFS: Entropy First Search for Dynamic Shortest Path Problem in Large Sparse Graphs

Journal of Computational and Theoretical Nanoscience ◽

10.1166/jctn.2017.6330 ◽

2017 ◽

Vol 14 (1) ◽

pp. 367-383

Author(s):

Quan Zhou ◽

Hui Zhao ◽

Huijie Zhang ◽

Shulin Tian ◽

Zhen Liu

Keyword(s):

Shortest Path ◽

Shortest Paths ◽

Shortest Path Problem ◽

Search Process ◽

Single Source ◽

Solution Path ◽

Sparse Graphs ◽

Path Search ◽

Speed Up ◽

Shortest Path Search

Searching the dynamic shortest path is a hot topic recently. In this paper we proposed a new method to solve the dynamic single source shortest paths (SSSP) problem in sparse graphs. The main contributions are three: firstly, in the preprocessing stage, we use the unreachable and unstartable characteristics to avoid most of the non-solution path search. Secondly, Entropy first search (EFS) is introduced to speed up the search process in finding the possible shortest path and then the algorithm can converges as soon as possible. In addition, the update algorithm for dynamic shortest path search is proposed for practical use. The experiments in large random sparse graphs show the efficiency and benefits of the proposed method.

Download Full-text