The Modeling Of Variable Transportation Network And The Research Of The Shortest Path Algorithm Based On Petri Net

With the development of society, science and technology unceasingenhancement, the transportation network system is becoming more andmore large, complex, how in large scale, structure complicated traffictransportation network for a high efficiency, in real, reliable shortest pathbut become people eager concern right now. For this problem, researchersand technical staff proposed a variety of solutions, such as: A*algorithm,the dynamic regulation, the ant colony algorithm, the Dijkstra algorithm,the ideas based on the transport knot stop "zero transfer" and GPSnavigation system and so on. But its path optimization premise generallyis based on the static transport network, which assumes that alltransportation network data is established, and the same, so there is noreal consideration to data in real time and dynamic variable in realtransportation network. Dynamic path of the transportation network toseek the key lies in the dynamic traffic data collection, processing,updating and real-time release, and then implemented to adjust the path tothe optimization. The positive sign of this, domestic and foreign scholarsin recent years made a lot of hard work to build the concept of intelligenttransportation network system, and have made some research.In intelligent transportation network, especially in dynamicvariables in real transportation network of research for hot topics, such ashow to transport network real variable modeling; How to put buildingvariables transportation network model formalized; How to convert aformal model computers can recognize the information calculations, etc.In view of this, this paper proposes a variable transportationnetwork shortest path algorithm based on Petri nets can be varied in real time variable transportation network shortest path to strike.In this paper, the work of the following aspects:a) Analyzes the current situation of the transportation networkpath to choose and problems, the application and the lack of current pathselection algorithm in the intelligent transportation network.b) Puts forward the improved algorithm of the shortest pathalgorithm for static transportation network based on Petri nets;c) Puts forward the shortest path modeling methods andalgorithms based on variable transportation network, and experimentalanalysis to prove the model and algorithm is an effective way to seek theshortest path in the transportation network.