| 罚转向网络最短路径研究 |
| |
| 引用本文： | 潘开灵,吕绪华.罚转向网络最短路径研究[J].武汉科技大学学报(自然科学版),1999(1). |
| |
| 作者姓名： | 潘开灵 吕绪华 |
| |
| 作者单位： | 武汉冶金科技大学管理工程系(潘开灵)，武汉冶金科技大学基础科学部(吕绪华) |
| |
| 摘 要： | 建立和研究了具有转向惩罚值的网络模型。在引入了罚转向网络符号及规则后，对所建立的罚转向网络模型的有关最短路径的性质进行了研究，提出了以标记法为基础的求解最短路径的算法，最后给出了应用该算法的一个简单实例。
|
| 关 键 词： | 最短路径 网络图 转向惩罚值 |
Research for Shortest path Algorithm in a Network with Swerve Penalty |
| |
| PAN Kai ling,LU Xu hua.Research for Shortest path Algorithm in a Network with Swerve Penalty[J].Journal of Wuhan University of Science and Technology(Natural Science Edition),1999(1). |
| |
| Authors: | PAN Kai ling LU Xu hua |
| |
| Institution: | PAN Kai ling 1 LU Xu hua 2 |
| |
| Abstract: | This paper developed a model for the network with swerve penalty (NSP). After the symbols and rules of NSP are defined, the properties of NSP are studied and three theorems about the relation of paths and their sub paths are proved. A shortest path algorithm based on NSP is proposed. An example applying the proposed algorithm to find shortest paths is presented. |
| |
| Keywords: | shortest path network swerve penalty |
| 本文献已被 CNKI 等数据库收录！ |
