The Application of the Dijkstra Algorithm in the Finding of the Optimal Solution for the Connected Road Network to Center Prishtina

The purpose of this study is to discover the optimal choice by applying the Dijkstra algorithm to the road network connecting four distinct stations to the Prishtina city center. Prishtina is the capital of Kosovo. During the study or use of algorithms for finding an optimal solution, the city is initially described as a vertex and the roads as branches of a graph. The weight of the branches can be explained by the length of the highways. The roads Mitrovica, Ferizaj, Peja, Gjakova, Gjilan and Podujeva, have been analysed. This study looks at all of directions that lead to the main city center, specifically the main plaza. This paper describes in detail the work of the Kruskal algorithm to discover the least spanning tree in the Prishtina road network and the Dijkstra algorithm to determine the roads with the minimum and greatest lengths in the connected road network to the city center. In this case, the study and application of the identification of routes with the lowest and highest cost is also carried out. Furthermore, Matlab and simulative software are utilized to evaluate the Dijkstra algorithm’s conclusions for calculating the shortest route and lowest cost, and a comparison is made between the two solutions. Furthermore, goods were distributed from these four directions to four separate warehouses in the city center, first finding the cheapest and most expensive solutions, then the optimal solution with the method of minimum cost and the MODI approach, including the transportation plan.