A Directed Graph Edge Weight Model Serving Path Planning

This paper constructs an edge weight optimization model based on the frequency of historical data, and determines the weights by counting the occurrence frequency of each edge in the historical data. Although this model has certain limitations, it determines that the upper limit of the Similarity in Measurement (SIM) value in the sample case is $\mathbf{0. 7 5}$. At the same time, a basic edge weight model is constructed based on the Dijkstra algorithm, and its SIM value is calculated to be approximately 0.24757. In addition, a path planning model is constructed based on multiindex optimization and the simulated annealing algorithm. Through analysis, an optimization function of the power function type is determined. The graph is divided into subgraphs for calculation and solved using the simulated annealing algorithm, and finally, the SIM value is $\mathbf{0. 7 5}$. The research shows that the constructed model can effectively optimize the SIM value of path planning, has good stability under different conditions, and provides an effective method for urban traffic path planning.