A GIS-based Network Analysis for Truck Vehicles in Baghdad's City Road Network

Most applications use distance as a weight to solve the shortest path problem. We employed a variety of parameters in this paper, including (Route Distance, Speed, and Capacity of the Road, and the time it takes each trip to the road). The major goal of this study is to determine the most effective approach for communicating this essential spatial information to end-users using GIS software. To discover the best route, most algorithm for best route (Dijkstra's shortest path algorithm, Euler's algorithm, etc.) are utilized. The proposed upgraded approach was applied to the Baghdad city road network as a case study. Baghdad has a problem in Processes for urban transportation planning are being implemented, particularly in terms of selecting appropriate transportation policies to address mobility issues. The Origin - Destination Matrix is a crucial component of the transportation planning process. One of the necessary aims of transportation studies in Baghdad city is the O-D matrix, which is the travel demand between (central Baghdad city and the commercial centers). The findings of this study can help local transportation authority's choose the best transportation policy, maximize income, and better manage resources.