Please use this identifier to cite or link to this item:
|Title:||Finding the shortest route using cases, knowledge, and Dijkstra's algorithm||Authors:||Liu, Bing
|Issue Date:||Oct-1994||Citation:||Liu, Bing,Choo, Siew-Hwee,Lok, Shee-Ling,Leong, Sing-Meng,Lee, Soo-Chee,Poon, Foong-Ping,Tan, Hwee-Har (1994-10). Finding the shortest route using cases, knowledge, and Dijkstra's algorithm. IEEE expert 9 (5) : 7-11. ScholarBank@NUS Repository. https://doi.org/10.1109/64.331478||Abstract:||The route finding problem is one of the most important computer applications in the transportation industry and is known as the shortest path problem in network theory and uses Dijkstra's algorithm to solve it. The authors built a prototype system that reduces the computation time required to find a route by integrating Dijkstra's algorithm with knowledge based and case based components. This system can be used as a general information system to help anyone in need to find his way around and can be installed in cars to help drivers find alternative routes to avoid traffic jams and accident areas.||Source Title:||IEEE expert||URI:||http://scholarbank.nus.edu.sg/handle/10635/99292||ISSN:||08859000||DOI:||10.1109/64.331478|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.