Research on the Shortest Path of Two Places in Urban Based on Improved Ant Colony Algorithm

摘要

Based on the GIS electronic map and traffic control information database, a shortest path algorithm based on GIS technology is proposed, the A and B geographic information of the monitoring points are extracted, and the shortest path algorithm is used to solve the shortest path between A and B. Using the improved ant colony algorithm to calculate the shortest distance from the start node to the target node. In view of the phenomenon of ant colony algorithm convergence speed is slow and easy to fall into premature defects, and the effective measures for improvement was put forward, and take the simplifying road network as an example, a simulation of the algorithm was conducted. The satisfactory results of the simulation verify the effectiveness of the algorithm.