Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
A Web Based Pathfinder Service for Road Networks in India
ICDCIT '08 Proceedings of the 5th International Conference on Distributed Computing and Internet Technology
Real-time GPS via Jamdroid server enhanced by TelegraphCQ & augmented by RFID tag
Proceedings of the International Conference on Advances in Computing, Communication and Control
Hybrid shortest path algorithm for vehicle navigation
The Journal of Supercomputing
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Hierarchical path planning for situated agents in informed virtual geographic environments
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
Travel time prediction for dynamic routing using ant based control
Winter Simulation Conference
An efficient shortest path computation system for real road networks
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Routing with free geodata on mobile devices
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
Spatial big-data challenges intersecting mobility and cloud computing
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Engineering highway hierarchies
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
The route computation module is one of the most important functional blocks in a dynamic route guidance system. Although various algorithms exist for finding the shortest path, their performance tends to deteriorate as the network size increases. We present an efficient hierarchical routing algorithm that finds a near-optimal route and evaluate it on a large city road network. Solutions provided by the hierarchical routing algorithm are compared with the optimal solutions to analyze and quantify the loss of accuracy. We propose a novel yet simple heuristic to substantially improve the performance of the hierarchical routing algorithm with acceptable loss of accuracy. A network pruning technique has been incorporated into the algorithm to reduce the search space and the correctness of the results is evaluated. The improved hierarchical routing algorithm that incorporates the heuristic techniques has been found to be over 50 times faster than a typical shortest path algorithm.