| 一类点权网络中的全局最大动态流问题 |
| |
| 引用本文： | 高明霞,贺国光.一类点权网络中的全局最大动态流问题[J].兰州铁道学院学报,2009,28(1):144-148. |
| |
| 作者姓名： | 高明霞 贺国光 |
| |
| 作者单位： | 高明霞,GAO Ming-xia(兰州交通大学交通运输学院,甘肃,兰州,730070;天津大学管理学院,天津,300072);贺国光,HE Guo-guang(天津大学管理学院,天津,300072)
|
| |
| 摘 要： | 全局最大动态流问题在交通运输等领域有着广泛的应用，以往关于该类问题的研究，基本上是针对只含弧权的普通网络或节点有一个停留时间和停留量限制的点权网络．但应用于某些实际问题时，网络中节点的权重具有方向性，一定数量的流通过节点时所耗费的时间和容量限制与其走行方向有关．本文针对这类点权网络，研究其全局最大动态流问题，建立了数学模型，提出了一种改进算法，并给出了数值算例．
|
| 关 键 词： | 全局最大动态流 点权网络 模型 改进算法 |
Universal Maximal Flow over Time in Some Network with Weight at Nodes |
| |
| GAO Ming-xia,HE Guo-guang.Universal Maximal Flow over Time in Some Network with Weight at Nodes[J].Journal of Lanzhou Railway University,2009,28(1):144-148. |
| |
| Authors: | GAO Ming-xia HE Guo-guang |
| |
| Institution: | 1.School of Traffic and Transportation;Lanzhou Jiaotong University;Lanzhou 730070;China;2.School of Management;Tianjin University;Tianjin 300072;China |
| |
| Abstract: | The universal maximal flow problem over time has been widely used in many fields like traffic and transportation problems etc..Previous approaches about such problem are mainly based on ordinary networks or networks with general holding time and capacity at nodes.However,in practical application,there exist some networks with directional weights at nodes,in which the time needed to cross nodes and the capacity limiting the value of flows are related to the going direction of flows.The universal maximal flow... |
| |
| Keywords: | universal maximal flow network with weight at nodes model improved algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
