辽宁工程技术大学学报（自然科学版）2024，Vol.43Issue(2)：150-155,6.DOI:10.11956/j.issn.1008-0562.2024.02.004
基于最小分支剩余容量的矿井通风网络极值流算法
Minimal branch residual capacity based extreme flow algorithm for mine ventilation network
摘要
Abstract
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.关键词
矿井通风网络/极值流/增广链/最小分支剩余容量/分层剩余网络Key words
mine ventilation network/extreme value flow/augmented chain/minimum branch residual capacity/hierarchical residual network分类
资源环境引用本文复制引用
贾廷贵,韦永盛..基于最小分支剩余容量的矿井通风网络极值流算法[J].辽宁工程技术大学学报（自然科学版）,2024,43(2):150-155,6.基金项目
内蒙古自治区自然科学基金项目(2022LHMS05019 （）
2022LHMS05020) （）
内蒙古自治区高等学校科学研究重点项目(NJZZ21025) （NJZZ21025）
