The simulation algorithm of military transportation shortest path based on petri net

The shortest transportation route is an important and basic problem in the military transportation. Currently, there are several methods developed to solve this problem, for example, the replace algorithm, Dijkstra algorithm, linear programming algorithm, etc. This paper proposes a new method to the shortest route problem - simulation algorithm of Petri network. This method defines the operation rule and step of the simulation device of Petri net on the basis of general Petri network. It changes the undirectional transportation network into EPN model automatically with the simulation device of Petri net, while describes the elements of the network. Meanwhile, dasiaplace timepsila is used to replace the arc length to perform the simulation operation and numerical processing of the simulation target system of the network. It calculates the corresponding shortest route and length automatically. This method is more vivid, more intuitionistic and faster than the existing methods, it is a more practical method and means.