Shortest Path Routing Using Heuristic Search
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. Efficie...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | en en |
| Published: |
2006
|
| Subjects: | |
| Online Access: | https://etd.uum.edu.my/1798/1/Ahmed_Omran_A._Alaiwan-shortest_paht_routing.pdf https://etd.uum.edu.my/1798/2/Ahmed_Omran_A._Alaiwan-shortest_paht_routing.pdf https://etd.uum.edu.my/1798/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1833435727677882368 |
|---|---|
| author | Alaiwan, Ahmed Omran A. |
| author_facet | Alaiwan, Ahmed Omran A. |
| author_sort | Alaiwan, Ahmed Omran A. |
| building | UUM Library |
| collection | Institutional Repository |
| content_provider | Universiti Utara Malaysia |
| content_source | UUM Electronic Theses |
| continent | Asia |
| country | Malaysia |
| description | 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. |
| format | Thesis |
| id | my.uum.etd-1798 |
| institution | Universiti Utara Malaysia |
| language | en en |
| publishDate | 2006 |
| record_format | eprints |
| spelling | my.uum.etd-17982013-07-24T12:13:12Z https://etd.uum.edu.my/1798/ Shortest Path Routing Using Heuristic Search Alaiwan, Ahmed Omran A. T Technology (General) 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. 2006 Thesis NonPeerReviewed application/pdf en https://etd.uum.edu.my/1798/1/Ahmed_Omran_A._Alaiwan-shortest_paht_routing.pdf application/pdf en https://etd.uum.edu.my/1798/2/Ahmed_Omran_A._Alaiwan-shortest_paht_routing.pdf Alaiwan, Ahmed Omran A. (2006) Shortest Path Routing Using Heuristic Search. Masters thesis, Universiti Utara Malaysia. |
| spellingShingle | T Technology (General) Alaiwan, Ahmed Omran A. Shortest Path Routing Using Heuristic Search |
| title | Shortest Path Routing Using Heuristic Search |
| title_full | Shortest Path Routing Using Heuristic Search |
| title_fullStr | Shortest Path Routing Using Heuristic Search |
| title_full_unstemmed | Shortest Path Routing Using Heuristic Search |
| title_short | Shortest Path Routing Using Heuristic Search |
| title_sort | shortest path routing using heuristic search |
| topic | T Technology (General) |
| url | https://etd.uum.edu.my/1798/1/Ahmed_Omran_A._Alaiwan-shortest_paht_routing.pdf https://etd.uum.edu.my/1798/2/Ahmed_Omran_A._Alaiwan-shortest_paht_routing.pdf https://etd.uum.edu.my/1798/ |
| url_provider | http://etd.uum.edu.my/ |