Algorithm for shortest path search in Geographic Information Systems by using reduced graphs

Abstract

The use of Geographic Information Systems has increased considerably since the eighties and nineties. As one of their most demanding applications we can mention shortest paths search. Several studies about shortest path search show the feasibility of using graphs for this purpose. Dijkstra’s algorithm is one of the classic shortest path search algorithms. This algorithm is not well suited for shortest path search in large graphs. This is the reason why various modifications to Dijkstra’s algorithm have been proposed by several authors using heuristics to reduce the run time of shortest path search. One of the most used heuristic algorithms is the A* algorithm, the main goal is to reduce the run time by reducing the search space. This article proposes a modification of Dijkstra’s shortest path search algorithm in reduced graphs. It shows that the cost of the path found in this work, is equal to the cost of the path found using Dijkstra’s algorithm in the original graph. The results of finding the shortest path, applying the proposed algorithm, Dijkstra’s algorithm and A* algorithm, are compared. This comparison shows that, by applying the approach proposed, it is possible to obtain the optimal path in a similar or even in less time than when using heuristic algorithms.

Evaluating Access to Eye Care in the Contiguous United States by Calculated Driving Time in the United States Medicare Population

“…Dijkstra’s algorithm was used to calculate the shortest route, defined as the path of shortest driving time from one location to another. 11 …”

Positive cooperative regulation of double binding sites for human acetylcholinesterase

“…Next, it is natural to identify the cooperative regulation pathway based on the network analysis. Shortest path algorithm was used to identify the regulation pathway between the catalytic active site and the peripheral anionic site …”

“…Shortest path algorithm was used to identify the regulation pathway between the catalytic active site and the peripheral anionic site. [42] The shortest pathway was identified in the hAChE/TZ5: W86-TZ5-W286 (Figure 10a). However, we could not find a similar pathway in the free hAChE.…”

Experiment Study of Rapid Laser Polishing of Freeform Steel Surface by Dual-Beam

“…The zigzag trajectory is a common practice in laser processing [3,18]; however, the pulsed laser is following up with the CW laser with its own square wave route besides the zigzag trajectory, its route network should be optimized individually. According to the route network optimization of previous works [19,20], the offset contours of laser scanning trajectory are marked in four directions, which are from left to right, from right to left, from top to bottom and from bottom to top, and the endpoints and intersections are connected in turn. Both the endpoints and intersections of the contour form the vertices V i of the route network, both the length of the line segment and the arc between the connections form the arc length A i .…”