| 基于Petri网的网络最小费用最大流算法 |
| |
| 引用本文： | 宋宇博,蒋兆远,牟海波. 基于Petri网的网络最小费用最大流算法[J]. 兰州交通大学学报, 2011, 0(3) |
| |
| 作者姓名： | 宋宇博 蒋兆远 牟海波 |
| |
| 作者单位： | 兰州交通大学机电技术研究所;兰州交通大学交通运输学院; |
| |
| 基金项目： | 甘肃省自然科学研究基金计划项目(1010RJZA074) |
| |
| 摘 要： | 将Petri网方法应用于求解网络的最小费用最大流问题,提出费用Petri网的定义,设计费用Petri网的变迁使能规则并提出求解最小费用最大流问题的Petri网算法.与以往的算法不同,该算法通过对库所进行标号寻找变迁的触发序列,并在该序列上增流.最后举例说明算法的应用.
|
| 关 键 词： | 最小费用最大流 费用Petri网 Petri网算法 触发序列 |
Algorithm for Seeking the Minimal Cost and Maximal Flow Based on Petri Net |
| |
| SONG Yu-bo,JIANG Zhao-yuan,MU Hai-bo. Algorithm for Seeking the Minimal Cost and Maximal Flow Based on Petri Net[J]. Journal of Lanzhou Jiaotong University, 2011, 0(3) |
| |
| Authors: | SONG Yu-bo JIANG Zhao-yuan MU Hai-bo |
| |
| Affiliation: | SONG Yu-bo1,JIANG Zhao-yuan1,MU Hai-bo2(1.Mechatronic Technology Institute,Lanzhou Jiaotong University,Lanzhou 730070,China,2.School of Traffic and Transportation,China) |
| |
| Abstract: | In this paper,Petri net is adopted for seeking the minimal cost and maximal flow of a network.The cost Petri net is proposed and the enabled rules of transitions are given.In addition,an algorithm for obtaining the minimal cost and maximal flow based on cost Petri net is developed.The proposed algorithm,which is different from the others,is to find the firing sequence of transitions by labeling places and to increase flows in this sequence.Finally,an example is given to demonstrate the application of the al... |
| |
| Keywords: | minimal cost and maximal flow cost Petri net Petri net algorithm firing sequence |
| 本文献已被 CNKI 等数据库收录！ |
|
