UUM ETD | Universiti Utara Malaysian Electronic Theses and Dissertation
FAQs | Feedback | Search Tips | Sitemap

Shortest Path Routing Using Heuristic Search

Alaiwan, Ahmed Omran A. (2006) Shortest Path Routing Using Heuristic Search. Masters thesis, Universiti Utara Malaysia.

[img] PDF
Ahmed_Omran_A._Alaiwan-shortest_paht_routing.pdf
Restricted to Registered users only

Download (1MB)
[img]
Preview
PDF
Ahmed_Omran_A._Alaiwan-shortest_paht_routing.pdf

Download (178kB) | Preview

Abstract

Shortest Path problems are inevitable in road network applications such as city emergency handling and drive guiding system, in where the optimal routing have to be found. To achieve the best path, there are many algorithms which are more or less effective, depending on the particular case. Efficiency depends not only on the time needed for calculation, but also on the reliability of the result. A* algorithm is able to return the best path (if it exists) between two nodes, according to accessibility/ orientation and, of course, cost of arcs. In this project A* algorithm was used, to suggest shortest path model between two selected points to find the fastest and shortest route on Malaysia map. This prototype then guides the users according to their interest and work.

Item Type: Thesis (Masters)
Uncontrolled Keywords: Heuristic Programming, Network Analysis, Network Planning
Subjects: T Technology > T Technology (General)
Divisions: Faculty and School System > Centre for Graduate Studies
Depositing User: Ms Rohaida Rohani
Date Deposited: 04 Jul 2010 01:25
Last Modified: 24 Jul 2013 12:13
URI: http://etd.uum.edu.my/id/eprint/1798

Actions (login required)

View Item View Item