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: | Alaiwan, Ahmed Omran A. |
---|---|
Format: | Thesis |
Language: | eng eng |
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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Traffic Balancing Method in Shortest Path Routing
by: Mohamed Abdulqader, Makarem
Published: (2007) -
A Matrix Usage for Load Balancing in Shortest Path Routing
by: Mustafa, Nor Musliza
Published: (2009) -
Hopfield model for shortest path computation and routing in ATM network /
by: Lee, Chee Weng
Published: (2001) -
Solving shortest path problem using gravitational search algorithm and neural networks
by: Sinaie, Saman
Published: (2010) -
Group Formation Using Shortest Path Approach
by: Khongkaew, Onchaya
Published: (2005)