Analysis Urban Traffic Vehicle Routing Based on Dijkstra Algorithm Optimization

Abstract

The transportation cost, running vehicle time, duration, and distance cost, the route network of revealed urban vehicles, are considered to need to be analyzed meaningfully and reasonably planned. This paper suggests an analysis of urban traffic vehicle routing based on the Dijkstra algorithm optimization that is as a solution to the road selection and optimization under various constraints jointly built in the central metropolitan area. The leading metropolitan area road network's various constraints are to consider the road condition factors and the risk resistance in road planning. The analysis and realization are verified with the geocoding, network topology, and network analysis. The results show that the integration of network analysis technology and the Dijkstra algorithm realizes the urban vehicle route's optimization decision. Still, the improved Dijkstra algorithm reduces the number of node visiting and time complexity. Under the driving time and distance constraints, the speed limit, road hierarchy, and road condition are the line selection's restrictive factors. The graphical description could provide technical support and reference for the driver's driving strip and traffic management department for decision making.