In this paper, petrinet is adopted for seeking the minimal cost maximal flow of a network. The cost petrinet is proposed and the enabled rules of transitions are given. In addition, an algorithm for obtaining the mi...
详细信息
ISBN:
(纸本)9783037853849
In this paper, petrinet is adopted for seeking the minimal cost maximal flow of a network. The cost petrinet is proposed and the enabled rules of transitions are given. In addition, an algorithm for obtaining the minimal cost maximal flow based on cost petrinet is developed. The proposed algorithm, which is different from the others, is to find the firing sequence of transitions by labeling places and increase flows in this sequence. Finally, an example is given to demonstrate the application of the algorithm. The results show that the given method can find the minimal cost maximal flow of a network efficiently.
The Dijkstra algorithm is the classic algorithm to solve the shortest path problem, but the solving process is relatively complicated. As the visual graphics ability and good computer skills of petrinet, it is used t...
详细信息
The Dijkstra algorithm is the classic algorithm to solve the shortest path problem, but the solving process is relatively complicated. As the visual graphics ability and good computer skills of petrinet, it is used to solve the shortest path problem, and according to the thought of directed petrinet and transition enabled rules, petri net algorithm of solving the shortest path problem is designed. Compared to the Dijkstra algorithm, this algorithm which omits the P, T tabs and λ, S functions of the Dijkstra algorithm, can make the solution of the shortest path simpler and more convenient, improve the solution efficiency, and at the same time provide convenience for achieving algorithm objectively using computer.
暂无评论