Road Map Estimation by using the Single Source Shortest Path Algorithm (DIJKSTRA'S Algorithm)

Abstract

Traffic congestion is becoming a serious problem in more and more modern cities. Encouraging more private-vehicle drivers to use public transportation is one of the most effective and economical ways to reduce the ever increasing congestion problem on the roads. To make public transport services more attractive and competitive, providing travellers with individual travel advice for journeys becomes crucial. However, with the massive and complex network of a modern division, finding one or several suitable route(s) according to user preferences from one place to another is not a simple task. This paper focuses on the uses of the Dijkstra’s algorithm to find the shortest path in the Sagaing Division. The implementation of the shortest path algorithm is presented by the undirected graphs. This paper is able to suggest unfamiliar public users to choose a route based on their preferences. Users can choose not only shorter route with more frequent station change but also longer route with less station change. This system can also calculate the solution path from the starting station to the intended station. Based on the solution path, the system suggests the shortest distance, minimum cost and minimum time of the paths for the user’s convenience. In order to develop a utility, this paper has selected the Java Language.