| 运输网络中最小饱和流的求解 |
| |
| 引用本文： | 吴薇薇,宁宣熙.运输网络中最小饱和流的求解[J].数学的实践与认识,2006,36(9):219-224. |
| |
| 作者姓名： | 吴薇薇 宁宣熙 |
| |
| 作者单位： | 南京航空航天大学经济与管理学院,江苏,南京,210016 |
| |
| 基金项目： | 国家自然科学基金;南京航空航天大学校科研和教改项目 |
| |
| 摘 要： | 运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.
|
| 关 键 词： | 运输网络 割集矩阵 堵塞截面 最小饱和流 |
| 修稿时间： | 2005年7月19日 |
Solve of the Minimum Saturated Flow in the Transportation Network |
| |
| WU Wei-wei,NING Xuan-xi.Solve of the Minimum Saturated Flow in the Transportation Network[J].Mathematics in Practice and Theory,2006,36(9):219-224. |
| |
| Authors: | WU Wei-wei NING Xuan-xi |
| |
| Abstract: | In a transportation network,blockage is a kind of phenomenon commonly happened because of uncontrollable flow.The saturated flow of blocking network is less than the maximum flow.It is an important parameter in designing a transport network,especially an emergency evacuation network.Find the blocking section through the cutting-set matrix.An algorithm is proposed to solve the minimum saturated flow.An example is shown that this algorithm is simple and applicable. |
| |
| Keywords: | transportation network the cutting-set matrix the blocking section the minimum saturated flow |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
