Shortest path performance within real road network: case study in Malaysia
The performance of shortest path algorithm has been tested in many researches. However, in most of the testing on shortest path algorithms have been based on randomly generated networks, which may not have the characteristics of real road networks. The purpose of this exploratory study is to identif...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
AENSI Publication
2012
|
| Subjects: | |
| Online Access: | http://eprints.uthm.edu.my/8191/ http://eprints.uthm.edu.my/8191/1/6.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The performance of shortest path algorithm has been tested in many researches. However,
in most of the testing on shortest path algorithms have been based on randomly generated networks,
which may not have the characteristics of real road networks. The purpose of this exploratory study is
to identify the performance of shortest path on Malaysia’s road network. In this paper, set of shortest
path algorithms has been evaluated using a variety of real road networks. Visual basic platform via
various types of computers has been adopted to evaluate the algorithm. The run time is collected to
obtain the result. Based on the result, Floyd-Warshall has produced the best running time for real road
network. |
|---|