By Topic

Combining hierarchical and heuristic techniques for high-speed route computation on road networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
G. R. Jagadeesh ; Centre for High Performance Embedded Syst., Nanyang Technol. Univ., Singapore, Singapore ; T. Srikanthan ; T. H. Quek

The performance of conventional route computation algorithms tends to deteriorate as the size of the network increases. A series of experiments were conducted on a real city road network to evaluate a heuristic technique before incorporating it into a hierarchical route-finding algorithm based on road types. The improved hierarchical algorithm computes a near optimal route in a fast and efficient manner by restricting the route computation to small subnetworks. The solutions provided by the algorithm are comparable to the optimal solutions.

Published in:

Computing & Control Engineering Journal  (Volume:13 ,  Issue: 3 )