Routing-based Topological Analysis on the Road Network in Myanmar

摘要

An efficient routing algorithm for the road network of Myanmar is presented. It utilises a concept of topological analysis and local information on the network to identify a routing strategy aiming to maximise traffic flow, feasibility of road selection and low processing time to identify suitable routes. The road network is represented by a weighted undirected graph. A new centrality measure is formed by combining degree and betweenness centralities with the Cantor pairing function, and employed to determine efficient paths between cities. Corresponding simulations reveal that the routes from source to destination cities generated by the algorithm meet the objectives set. It requires the lowest processing times as compared with the current approaches to generate routes, which show high average degrees and betweenness centralities.