基于最小分支剩余容量的矿井通风网络极值流算法
Minimal branch residual capacity based extreme flow algorithm for mine ventilation network
贾廷贵 1韦永盛1
作者信息
- 1. 内蒙古科技大学 矿业与煤炭学院,内蒙古 包头 014010
- 折叠
摘要
为计算矿井最大通风量,针对最短增广链算法随机选取增广链,造成增广链缺失和极值流偏小的问题,提出一种基于最小分支剩余容量的矿井通风网络极值流算法.该算法在选取增广链时,选择中间分支剩余容量最小的增广链进行增广;每次增广完毕后,优先选择与增广完毕的增广链包含相同分支的增广链进行下一次增广.利用Excel Solver解算模型与BA无标度随机网络进行仿真实验,结果表明该算法比最短增广链算法解算时间短,且避免了增广链缺失.研究结论为矿井最大通风量的计算提供理论参考.
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引用本文复制引用
基金项目
内蒙古自治区自然科学基金项目(2022LHMS05019)
内蒙古自治区自然科学基金项目(2022LHMS05020)
内蒙古自治区高等学校科学研究重点项目(NJZZ21025)
出版年
2024
国家科技期刊平台
NSTL
万方数据