The Optimal Path Algorithms On City Roads

In recent decades, with the development of our national economy, Traffic transport industry has been an unprecedented development, The development of transportation industry has promoted the material exchanges and personnel come-and-go, greatly shorten the travel time, improve work efficiency; on the other hand, traffic congestion and environmental pollution problems attendant. Traffic jam and traffic accidents increasingly puzzled the world’s large city, in order to improve the transportation network efficiency, solve the traffic congestion and traffic safety problem, it is necessary to carry out the city traffic real-time optimal path research, in order to facilitate travelers.With the development of science and technology, we can apply computer technology, communication technology, network technology and embedded technology to the traffic field, through the comprehensive application of various technology, provide enough travelling information to people. Due to the provision of real time information, therefore the whole city vehicle flow has been realized the adaptive function, the city traffic system is achieved the most fully utilized, which can ease the traffic situation.Dijkstra algorithm, Floyd algorithm, A*algorithm is a greedy algorithm and static shortest path algorithm, can not reflect the currently actual situation, the ant colony algorithm is simulation of ant foraging behavior, can be effective respond on the outside situation reform, so it can be more effectively adjust to the outside complexion and have real-time characteristics, have the adaptation on the real-time optimal path selection.This paper introduces the optimal route selection research, introduces the data representation and data storage method in the traffic system, based on the study of Dijkstra algorithm, A*algorithm, we have a deep understanding of the advantages and disadvantages of the two algorithms and have a clear understanding about them, on the basis of this we introduce a new algorithm-ant colony algorithm, the application of the ant colony algorithm in optimal path selection has been a theoretical research and ameliorated it, Dijkstra algorithm, A*algorithm and ameliorative ant colony algorithm were compared through the test, A*algorithm is better than Dijkstra algorithm, and the ameliorative ant colony algorithm in the case of the large scale problem is best effect, and more data, more obvious advantage.