基于最小分支剩余容量的矿井通风网络极值流算法OA北大核心CSTPCD

In order to calculate the maximum ventilation volume of mine,a mine ventilation network extreme flow algorithm based on minimum branch residual capacity is proposed to overcome the problem of missing augmenting paths caused by randomly selecting augmenting paths in the shortest augmenting path algorithm,leading to underestimated extreme flows.With this algorithm,the augmenting path with the smallest residual capacity in the middle branch is chosen for augmentation.After each augmentation,priority is given to selecting augmenting paths that contain the same branches as the completed augmenting path for the next augmentation.Simulation experiments are conducted using Excel Solver and BA scale-free random networks.The results demonstrate that this algorithm has a shorter solution time compared to the shortest augmenting path algorithm and avoids missing augmenting paths.The research conclusion provides a theoretical reference for the calculation of the maximum ventilation volume of the mine.