The Shortest Path Algorithm Based on Petri Net

Yu-jie Zheng (), Kai-hu Hou (), Wei-zhen Liao and Lin Yang
Additional contact information
Yu-jie Zheng: Kunming University of Science and Technology
Kai-hu Hou: Kunming University of Science and Technology
Wei-zhen Liao: Kunming University of Science and Technology
Lin Yang: Kunming University of Science and Technology

Chapter Chapter 21 in The 19th International Conference on Industrial Engineering and Engineering Management, 2013, pp 221-229 from Springer

Abstract: Abstract 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 Petri Net, it is used to solve the shortest path problem, and according to the thought of directed Petri Net 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.

Keywords: Dijkstra algorithm; Petri Net algorithm; Petri Net of directed network; The shortest path problem (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-37270-4_21

Ordering information: This item can be ordered from
http://www.springer.com/9783642372704

DOI: 10.1007/978-3-642-37270-4_21

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().