摘要： 为解决智能交通系统中交通运输网络分析和最短路径问题，提出加权标识S-图最短路径算法。根据Petri网基本原理和加权S-图的特点，给出交通网络加权S-图的网模型。阐述加权标识S-图最短路径的基本原理、求解加权标识S-图的最短路径定理及证明。通过交通运输网络示例和实验对算法进行验证，对比分析算法性能。结果表明，加权标识S-图最短路径算法能够更有效地求解交通网络最短路径。

关键词: Petri网, 加权标识, S-图, 网模型, 最短路径

Abstract: In order to solve the intelligent transportation system in transportation network analysis and the shortest path problem, this paper proposes a weighted identification S-graph shortest path algorithm. According to the basic principle and Petri nets weighted S-graph characteristics, it puts forward the weighted S-graph network model. A weighted identification shortest path S-graph basic principle is illustrated, a weighted S-map identifies the shortest path. Through the transportation network of sample and experiment verified, the algorithm is compared and analyzed. Experimental results show that the weighted identification S-graph shortest path algorithm for solving the transport network is an effective method for the shortest path.

Key words: Petri net, weighted identification, S-graph, net model, shortest path

中图分类号: 

• TP18