Modified Dijkstra's Algorithm using the A* Algorithm to Extract the optimal path Based on ARC GIS PRO- Case Study: Damascus Regional Network-

Abstract

The Regional network represent using GRAPH theory. Which

depends on representing the network's traffic intersections with nodes, and streets with links. In this study, Dijkstra algorithm

has been used to analyze the network of Damascus City using Arc gis pro. We assumed an origin point (Almojtahed) and three destination points (Abbasid Square - the end of the Mazzeh

highway – Damascus University). Three basic criteria has been used in the analysis: distance (Euclid's boarder), speed, and travel time. After performing the analyzes according to the DIJKSTRA algorithm, we noticed that the algorithm depends mainly on choosing the optimal path according to the shortest distance. In result, Dijkstra has been modified according to the A* algorithm. The costs were analyzed in both cases, and we noticed that the optimal paths in the A^* are higher than the Dijkstra algorithm. Using the MCS multiple criteria analysis (speed - flight time - traffic intensity - distance). The Optimal paths were extracted. A field measurement was carried out on the routes proposed by the modified algorithm A^*, and the travel time was measured at peak hour. We noticed that the differences in travel times approximately 0.5 minutes as the highest value. The dynamic analysis can be done using the modified algorithm A^*.