摘要
堵塞是以人为主体的运输网络在随机流动情况下经常发生的一种现象.所谓网络最小流是指一个运输网络发生最严重堵塞情况下的最大流量,它是设计运输网络,特别是紧急疏散网络的一个重要参数.本文在网络堵塞流理论研究的基础上提出了网络最小流的基本概念,并从组合优化角度定义了网络最小流问题,提出了求解网络最小流的双向增流算法.文中详细介绍了实施这种算法的具体步骤,并用实例进行了说明.
Blockage is a kind of phenomenon t happened grequently in a transport network in which human beings are the moving subjects. The minimum flow defined in this paper means the maximal flow through a network in the most seriously-blocked situation of the network. It is an important parameter in designing a transport network, especially an emergency evaluation network. In this paper the fundamental concepts of minimum flow of a network are introduced on the basis of blocking flow theory, and the minimum flow problem is defined from the viewpoint of combined optimization. An efficient algorithm called ' Two way Flow -Augmenting Method ' is developed to solve the minimum flow problem and demonstrated by the example in detail.
出处
《系统工程》
CSCD
1997年第1期50-57,共8页
Systems Engineering
基金
国家自然科学基金资助项目
课题号79470044
关键词
图论
网络流理论
堵塞流
最小流
Graph Theory, Network Flow, Blocking Flow. Minimal Flow
