Application of Dijkstra’s Algorithm to find the minimum travel time for public transport in a city

Public transportation systems are essential to sustainable urban mobility, particularly in densely populated cities. To achieve this, Dijkstra's Algorithm has been applied to two important objectives: to find the minimum travel time using Dijkstra's Algorithm and to recommend the shortest route for bus transportation services. The transportation network is represented as a graph with nodes representing some key landmarks and edges weighted by travel times and penalties including traffic signals and junctions. Manual calculations in the area of study has been calculated and in order to effectively implement the algorithm, Microsoft Excel and Open Solver were used to provide an expandable, user-friendly platform for computational analysis and visualization. Based on the finding, the shortest path is achieved in 9.30 minutes starting from Node 3 to Node 10. Overall, the results show that Dijkstra’s algorithm is a simple yet competent approach in finding the shortest path for bus services within a short time period.