Study Of Quasi-Physical Method In The Dynamic And Shortest Path

With the development of global economy, the need of traffic and transportation is more and more urgent. And the possibility of building new roads or extending old roads is smaller. It cannot meet the traffic demand only relying on construction of the infrastructure. The urban traffic jam becomes more and more serious.With the rapid development of science and technology, especially those of the computer, the network and communication has already permeated in traffic field progressively. With the rapid development of the computer and information technology, Geographic Information Systems is used widely deeply day by day. It is urgent for city traffic administration development to use modernized technologies to manage urban traffic, lead and control the traffic to flow efficiently and effectively, speed up the operational efficiency of the existing traffic network. Thus the intelligent transportation system (ITS) is proposed. Urban Traffic Flow Guidance System (UTFGS) is an important part of the intelligent transportation system. It is also the key to solving city traffic problem. The shortest path algorithm is the core of the traffic network analysis, and network analysis is one important part in spatial analysis. In addition the shortest path problem is the basic in network analysis. It is the foundation in many fields by choosing the optimum route and it plays an important role in network analysis.This paper is a study of quasi-physical method in the dynamic and shortest routing of road network based on traffic information. Firstly, this paper describes the shortest route from the view of graph theory discussing the typical algorithm of the static shortest route and the dynamic shortest route with enough information. Secondly, it describes the quasi-physical method and it' s application, giving the process to settle the problem using quasi-physical method. At last, it analyzes the disadvantages of the existing algorithm of the static shortest route and the dynamic shortest route. On this basis, it gives...