2023-02-07T14:26:32Z
https://meral.edu.mm/oai
oai:meral.edu.mm:recid/3500
2022-03-24T23:15:00Z
1582963302567:1597824273898
user-ucsy
Comparing Shortest Path Algorithms for Real Road Network
Hmon, Moh Moh Wut
Htway, Thin Thin
This system deals with the problem of finding shortest paths in traversing some location within Myanmar. In particular, it explores the use of three approaches, Dijkstra’s shortest path algorithm, Bellman-Ford shortest path algorithm and A* algorithm in constructing the minimum spanning tree considering the carriage ways in the road network of Myanmar. The result shows a remarkable reduction in the actual distances as compared with the ordinary routing. Comparing Dijkstra’s shortest path algorithm, Bellman-Ford shortest path algorithm and A* algorithm which can produce the minimum calculating time to reach the goal. This result indicates, clearly the importance of these types of algorithm in optimization of network flows. This thesis is implemented by using Microsoft Visual Studio 2008 and Microsoft SQL Server 2005.
2010-12-16
http://hdl.handle.net/20.500.12678/0000003500
https://meral.edu.mm/records/3500