| 关于运输网络堵塞流动的研究——分支定界法在求解网络最小流上的应用（Ⅲ） |
| |
| 引用本文： | 宁宣熙. 关于运输网络堵塞流动的研究——分支定界法在求解网络最小流上的应用（Ⅲ）[J]. 南京航空航天大学学报(英文版), 1996, 0(2) |
| |
| 作者姓名： | 宁宣熙 |
| |
| 作者单位： | 南京航空航天大学工商学院 |
| |
| 摘 要： | 堵塞是以人为主体在运输网络中经常发生的一种现象。本文中所定义的网络最小流是指在最严重堵塞的情况下通过网络的最大流量，是设计和运行一个运输网络，特别是一个紧急疏散网络的重要参数。本文在堵塞流理论研究的基础上，提出了一种用分支定界思想来求解网络最小流问题的方法，并用实例说明了该算法过程及其应用领域
|
| 关 键 词： | 网络流；图论；网络流规划；最小流；堵塞流 |
THE APPLICATION OF THE BRANCH AND BOUND METHOD FOR DETERMINING THE MINIMUM FLOW OF A TRANSPORT NETWORK |
| |
| Research on the Blocking Flow in a Transport Network. THE APPLICATION OF THE BRANCH AND BOUND METHOD FOR DETERMINING THE MINIMUM FLOW OF A TRANSPORT NETWORK[J]. Transactions of Nanjing University of Aeronautics & Astronautics, 1996, 0(2) |
| |
| Authors: | Research on the Blocking Flow in a Transport Network |
| |
| Abstract: | Blockage is a kind of phenomenon frequently occurred in a transport network, in which the human beings are the moving subjects. The minimum flow of a network defined in this paper means the maximum flow quantity through the network in the seriously blocked situation. It is an important parameter in designing and operating a transport network, especially in an emergency evacuation network. A branch and bound method is presented to solve the minimum flow problem on the basis of the blocking flow theory and the algorithm and its application are illustrated by examples. |
| |
| Keywords: | network flow graph theory network programming minimum flow blocking flow |
| 本文献已被 CNKI 等数据库收录！ |
