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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Dijkstra EW (1999) A nite on two problem in connexion with graphs. Numerische Mathematik 1(1):269–271
Ding Yijie, Li Xiaozhong (2011) Modeling and analysis of knowledge flow based on colored Petri Nets. J Syst Simul 23(Suppl 1):287–290 (in Chinese)
Gan Ying’ai (2005) The operational research. Tsinghua University Press, Beijing, pp 260–264 (in Chinese)
Hu Xiongying, Hu Bin, Zhang Jinling (2010) Solving the random network shortest circuit simulation method based on STPN. J Wuhan Univ Sci Technol (Inf Manag Eng Ed) 32(2):197–201 (in Chinese)
Jong WT, Shiau YS, Horng YJ et al (1999) Temporal knowledge representation and reasoning techniques using time Petri Nets. IEEE Trans Syst Man Cybern Part B 29(4):541–545
Li Shuju, Li Wenjing, Wang Rujing (2011) Study of shortest path based on weighted indentification S-graph. J Comput Eng 37(15):46–48 (in Chinese)
Li Xiongfei, Zhang Hailong, Liu Zhaojun (2011) Problem for shortest path problem based on heuristic algorithm. J Jilin Univ (Eng Technol Ed) 41(1):182–187 (in Chinese)
Noshita K (1985) A theorem on the expected complexity of Dijkstra’s shortest paths algorithm. J Algorithm 6(3):400–408
Noshita K, Masuda E, Machida H (1978) On the expected behaviors of the Dijkstra’s shortest paths algorithm for complete graph. Inf Process Lett 7(5):237–243
Song Yubo, Jiang Zhaoyuan, Mu Haibo (2011) Algorithm for seeking the minimal cost and maximal flow based on Petri net. J Lanzhou Jiaotong Univ 30(3):67–70 (in Chinese)
Sun Zhixin, Gao Yanjuan, Wang Wending (2007) Complete dynamic algorithm for updating shortest path tree. J Jilin Univ (Eng Technol Ed) 37(4):860–864 (in Chinese)
Wang Guangqiu, Zhang Bin (2009) Optimum route sequence search in stochastic Petri Net based on reliability of transition. J Syst Eng Electron 31(1):187–194 (in Chinese)
Wang Zhijian, Han Weiyi, Li Yijun (2010) Shortest path problem with multiple shortest paths. J Harbin Eng Univ 42(9):1428–1431 (in Chinese)
Yao Yulin (1994) A Petri Net modal for temporal knowledge representation and reasoning. IEEE Trans Syst Man Cybern 24(9):1374–1382
Yu Ping, Cao Jiping, Song Jianshe (2011) Improved fuzzy Petri Net algorithm and its application in fault diagnosis. Ordnance Ind Autom 30(6):20–22 (in Chinese)
Zhou Ling, Wang Jianxin (2011) Path nodes-driven least-cost shortest path tree algorithm. J Comput Res Dev 48(5):721–728 (in Chinese)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, Yj., Hou, Kh., Liao, Wz., Yang, L. (2013). The Shortest Path Algorithm Based on Petri Net. In: Qi, E., Shen, J., Dou, R. (eds) The 19th International Conference on Industrial Engineering and Engineering Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37270-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-37270-4_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37269-8
Online ISBN: 978-3-642-37270-4
eBook Packages: Business and EconomicsBusiness and Management (R0)