Search. Read. Cite.

Easy to search. Easy to read. Easy to cite with credible sources.

Asian Journal of Information Technology

Year: 2020  |  Volume: 19  |  Issue: 9  |  Page No.: 163 - 170

Reducing the Search Space in Real-Road Shortest Path Finding using Elliptical Pruning With Geographical Databases

P. Ganesh Kumar, S. Karthik, R. Nidhya and R.M. Bhavadharini


Real-road shortest-path finding algorithms involve large set of geographical data which include geo-tagged nodes and edges of the road network. Practical shortest path finding algorithms need minimized search-space for performing these computations by keeping these data in the computer’s conventional memory. The hierarchical pruning methods for minimizing the search-space to support real-road shortest algorithms are more suitable for connecting multiple cities and towns via highways. This study is to present a new suitable pruning method for intra-city shortest path finding, called elliptical pruning to bring the geo-tagged nodes and edges in to the memory for the subsequent shortest path finding process for the complex city road-transport networks.