Optimal Path Planning Method for Emergency Repair Based on Heating GIS System

With the continuous development of GIS., its application is increasingly widespread and has a great impact in many aspects., and the shortest path algorithm is an essential method based on the realization of the shortest path selection. In this paper, an improved path planning research method of ant colony algorithm is proposed for the optimal path planning problem of multiple heat exchange stations that need to be repaired at one time. Firstly., a reward and punishment mechanism is used to update the pheromones on the paths, and limits are set on the maximum and minimum values of each path pheromone respectively., so that the convergence speed of the algorithm can be effectively improved; secondly., an adaptively adjusted amplification factor is introduced into the heuristic function to improve the difference of heuristic information of neighboring nodes., so that the ants search in the direction of the optimal path; then, by adjusting the heuristic function factor., the pheromone volatility factor and pheromone factor are dynamically adjusted to improve the search speed of the ant colony and make the algorithm converge quickly. Finally., an improved optimal path analysis method of the ant colony algorithm is proposed., and the optimal path algorithm is implemented on a GIS platform., and the performance of the algorithm is analyzed.