TWO-WAY-TRACKER- A GIS ANCHORED GRAPH SEARCHING METHOD
Subhadip Boral · International Journal of Advanced Research in Computer Science · 2017
Reaching at the goal node in a connected weighted graph, preferably through the optimal path, starting journey from a given source node, plays an important role in GIS. Because, utilizing GPS enabled devices, to reach at destination, is now a very common practice, without having any prior knowledge about the journey. As number of accidents is increasing on each successive day we should prefer not only the shortest but also the short and safe route. The novel intent of the proposed work is to find the shortest path between two places with most safety. Basically the safety measures have been granted for journey through ocean, but could easily be applied for roadways also, just by changing the influencing factors. All the possible routes touching different cross points could be viewed as connected weighted graph, where various cross points; including source and destination are the nodes. As the target is to find Optimal and Safest path, so not only the length of edge (i.e. distance between its two end points) but also various factors affecting the safety of the journey plays active role in determination of the edge weight. Computation of path weightage has been executed through Regression Analysis using fifth degree polynomial curve fitting, based on input data from historic/ geographic data. The outcome of the method has been graphically displayed which is not only cheaper with respect to distance traversed but also safer in dodging the presence of hazardous weather. The algorithm is implemented in JAVA platform using NetBeans IDE 8.0.2 and the Experimental Result is shown in GUI. Finally, the present techniques have been compared with various Goal Searching techniques for connected graph such as Generate and Test, Simple Hill Climbing, Steepest Ascent Hill Climbing, Best First Search, Dijkstra’s Method and so on.