By Topic

Finding the shortest route using cases, knowledge, and Djikstra's algorithm

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
$31 $13
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

7 Author(s)
Bing Liu ; Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore, Singapore ; Siew-Hwee Choo ; Shee-Ling Lok ; Sing-Meng Leong
more authors

This prototype system integrates Dijkstra's algorithm with knowledge-based and case-based components, reducing the time required to find the shortest path between points in a road network.<>

Published in:

IEEE Expert  (Volume:9 ,  Issue: 5 )