Kepintaran Mencari Jalan Terdekat

ZAKARIA, HASBULLAH (1998) Kepintaran Mencari Jalan Terdekat. Other thesis, Universiti Teknologi Malaysia.


Download (2957Kb) | Preview


Imagine a tourist rents a car and plans to drive around a city. Before going from one place to another, he/she needs to know the best route to be taken. In Network Theory, this is the shortest path problem. Shortest path algorithms are often used to solve the problem. However, these algorithms are wasteful in term of computation when applied to the route finding task. They may also produce solutions that are not appropriate for human driver. In practice, knowledge about the road network can often be used to substantially reduce the time and space required in the computation, and to produce solutions that are suitable for human user. In this project, I have explored the approach of combining a shortest path algorithm with knowledge about the road network to solve the problem of finding the best route

Item Type: Thesis (Other)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Computer Science and Information System > Software Engineering
Depositing User: Unnamed user with email
Date Deposited: 04 Jul 2013 07:24
Last Modified: 04 Jul 2013 07:24

Actions (login required)

View Item View Item