The shortest path of city's road network based on the improved ant colony algorithm

The shortest path in the city's road network is very important for traffic guidance syste. The basic ant colony system algorithm is discussed for getting the shortest path. Furthermore the improved ant colony system algorithm is proposed to solve the problem that the basic ant colony system algorithm is easy to run into the local optimum solution. Some improved methods for the selection strategy, local search, and information quantity modification of basic ant colony system are discussed in detail. The experiments are implemented on the road network of Beijing city in China. The experimental results show that comparing with the basic ant colony algorithm, the improved algorithm can easily converge to the global optimum for the shortest path.