中文摘要：

通风网络解算、按需分风优化调节、基于固定风量调节反算风阻等工程实际问题均存在固定风量平衡问题。为判断在固定风量分支的位置、个数、风量都不确定的前提下,是否存在同时满足固定风量条件和风量平衡条件的通风网络风量分配方案,将固定风量平衡问题转化为网络流分配问题,令固定风量分支的容量上界与下界均等于固定风量值,其他分支的容量视为无穷大,判断是否存在所有固定风量分支均达到饱和状态的可行流,利用最大流算法求解可行流问题。如果存在可行流,则最大流方法的分配结果便可同时满足固定风量条件和风量平衡条件,即为通风网络风量的初始分配方案。通过正反2个实例验证,表明该方法可行。

英文摘要：

The paper is engaged in a study of the algorithm for balancing the fixed air flows without equal resistance constraints in the circuits. As is known,there always exists a problem of ventilation regulation in coal mining,such as the problem on how to regulate and balance the location,number,quantity of the fixed volume of the ventilators to meet the needs of the different locations in the mining tunnels and the goafs. As to the problem of the so-called balance of the fixed air flow,it may involve the decision whether and how to solve the ventilation network volume and send the necessary air volume to meet the needs of the particular mining spots. Unlike the classical maximum flow problem which has to meet the conditions of the fixed volume and air volume balance,all the branches of a coal mine may have two capacity bounds： the lower bound and upper bound. The upper and lower capacities of the fixed volume branches have been set up to their fixed maximum volume,while the upper capacities of other branches were to be set up to the infinity. Of course,the lower capacities have no way out but to be set to zero. In so doing,a little change can be made to the ventilation source or the network origin by means of adding two virtual sources-sink nodes and splitting each fixed volume branch into two new subbranches.Thus,a new branch has to be connected to the virtual source or sink node,whose capacity has to be worked out in accordance with certain rules. What is more,the branches of the new transferring network are to be endowed with upper capacities,lower capacities,as well as the default to zero,so that the problem can be transformed into the classical max flow one. Therefore,a classical max flow algorithm can be adopted to solve this transformed network flow problem. Among them,a feasible max flow can be chosen if the flow of each of the fixed volume branches can be saturated and make it to reach its capacity limits. And,it has become obvious that the feasible max flow can meet the conditions of the fixed volume and t