摘要
运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.
In a transportation network, blockage is a kind of phenomenon commonly happened becatlse 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.
出处
《数学的实践与认识》
CSCD
北大核心
2006年第9期219-224,共6页
Mathematics in Practice and Theory
基金
国家自然科学基金(70571037)
南京航空航天大学2005年博士学位论文创新与创优基金(BCXJ05-08)
关键词
运输网络
割集矩阵
堵塞截而
最小饱和流
transportation network
the cutting-set matrix
the blocking section
the minimum saturated flow
