UCSY's Research Repository

Comparing Shortest Path Algorithms for Real Road Network

Show simple item record

dc.contributor.author Hmon, Moh Moh Wut
dc.contributor.author Htway, Thin Thin
dc.date.accessioned 2019-07-24T15:12:36Z
dc.date.available 2019-07-24T15:12:36Z
dc.date.issued 2010-12-16
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1244
dc.description.abstract 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. en_US
dc.language.iso en en_US
dc.publisher Fifth Local Conference on Parallel and Soft Computing en_US
dc.subject Dijkstra’s algorithm en_US
dc.subject Bellman-Ford, A* en_US
dc.title Comparing Shortest Path Algorithms for Real Road Network en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account