2006•Shuxue de shijian yu renshiRequires access

Solve of the Minimum Saturated Flow in the Transportation Network

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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Flow network, Flow (mathematics), Blocking (statistics), Maximum flow problem, Computer science, Set (abstract data type), Mathematical optimization, Mathematics