The City Of Traffic Dynamic Route Guidance Algorithm Research And System Design

Intelligent Transportation Systems(ITS) is the application of computer, communication, and control technologies to help drivers and operators making smart decisions while driving smart vehicles or controlling traffic on smart road networks. It bases on the modern advanced science and technology. Route guidance system is one of the core of Intelligent Transportation Systems. The most important task of route guidance system is offering effective and high performance/price drive route from current location to destination for those vehicles which driving in the road network. That is path planning to traffic network and provide the serving of searching the best path for the driving vehicles. The key to complete the route guidance system is solving the problem of searching the best path.This paper studies and tests the key techniques of the shortest path analysis according to the characteristics of city road network. The paper first introduced some theories about network analysis, graph theory and geographic network modeling; Then this paper discussed the problem that how to express the road network in digital map; Base on the theory, this paper take graph theory as the principal way to analyze the rode network in digital map, and transform the problem of searching the shortest path in road network to searching the shortest path in graph.Searching the shortest path is a classical problem in graph theory. This paper introduced some classified arithmeticians for example Dijkstra arithmetic, Floyd arithmetic and heuristic search arithmetic emphatically. Some compare were showed among these arithmeticians with the time complexity in the paper, and some optimize ways were discussed aim at the defect of expression mode and memory structure of traditional arithmeticians. Based upon heuristic search arithmetic, the paper also presents an effective arithmetic of the shortest path search, which can find the shortest path between two nodes with high speed and great accuracy Without having to search the invalidate nodes. At last a sort of software about searching best path was programmed with reformed arithmetic.