检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:贾明涛[1,2] 涂小腾 任助理 陈鑫[1,2] 宋华强[1,2] JIA Mingtao;TU Xiaoteng;REN Zhuli;CHEN Xin;SONG Huaqiang(School of Resources and Safety Engineering,Central South University,Changsha 410083,Hunan,China;Center of Digital Mine Research,Central South University,Changsha 410083,Hunan,China;Beijing Auxin Chemical Technology Ltd.,Beijing 100040,China)
机构地区:[1]中南大学资源与安全工程学院,湖南长沙410083 [2]中南大学数字矿山研究中心,湖南长沙410083 [3]北京奥信化工科技发展有限责任公司,北京100040
出 处:《黄金科学技术》2018年第3期318-324,共7页Gold Science and Technology
基 金:国家自然科学基金项目"基于深度学习和距离场的复杂金属矿体三维建模技术"(编号:41572317);中央高校基本科研业务费专项资金"自然崩落法放矿计划优化方法与可视化编制技术研究"(编号:2016zzts450)联合资助
摘 要:最终境界对露天矿开采效益至关重要,而求解速度慢且结果不准确是最大流最小割算法在露天矿境界优化中的一个固有缺陷。对已有最大流最小割算法进行改进,以净现值(NPV)最大为目标,首先以最大几何境界内的价值块构造有向网络图,通过聚合网络图节点减少弧的复杂度,并在残留网络中对负价值节点增加开采约束,以保证得到的最小割集中正价值块受到负价值块的约束,最终通过C++编程实现该算法对露天矿进行境界优化。经实例验证,该方法科学可行,克服了原算法求解速度慢且结果不准确的弊端,且求解效率提高了近600 s,该算法具有理论上的优越性和实用性。The ultimate boundary was very important to the benefit of open-pit mining,but the maximum flow minimum cut algorithm easily trapped into solved the problem more slowly,and its result was not accurate in open-pit mine boundary.The existing maximum flow minimum cut algorithm was improved,with the goal of maximizing net present value(NPV),first of all,the vector graph was created by the value blocks in maximize the geometric boundary,by aggregating the network graph nodes to reduce the complexity of the arc,and the negative value was constrained in the residual network nodes to ensure the positive value of the minimum cut set was constrained by the negative value,the algorithm was achieved by C++programming in boundary optimization of open-pit mining.The example validation shows that the method is scientific and feasible,it overcomes the drawback that the original algorithm is slow and inaccurate,and the solution efficiency is improved by nearly 600 s,the algorithm has theoretical superiority and practicability.
关 键 词:露天矿 境界优化 最大流最小割算法 最大几何境界 净现值 几何约束 网络图 价值块
分 类 号:TD854[矿业工程—金属矿开采]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.190.158.12