基于GIS的Dijkstra算法改进研究
The Improvement Research of Dijkstra Algorithm Based on GIS
Based on the geographic information system (GIS), aimed at the problems of single source shortest path Dijkstra algorithm’s low efficiency, the nodes connected to the outside world in a community are used as the community representative points through the network partition method, so as to reduce the number of nodes and the scale of problem solving. The complex road network is degraded into a simple road network to improve the search efficiency. Combined with the artificial potential field method, the potential field intensity of the source point to the target point is calculated. By comparing the intensity of the potential field of the temporary node, the source point and the target point, the search is carried out in a certain direction, and the search range in the Dijkstra algorithm is reduced. Experiments show that the optimized results can effectively improve the search efficiency.
网络分割 / Dijksta算法 / 人工势场法 {{custom_keyword}} /
Network partition / Dijksta algorithm / artificial potential {{custom_keyword}} /
/
〈 |
|
〉 |