以运费最小为目标的露天矿剥—排对位算法研究及运用

发布时间：2018-12-26 14:10

【摘要】：露天矿排土运输存在理论上的最优方案,但受限于剥离和排运复杂的实际情况,利用现有算法规划的排运方案,既不能保证整个境界内所有岩石的排运总费用最小,也不能确定境界内每个待排岩石相应的排土信息,难以被有效地运用在矿山实际的排土运输中。本文以露天矿数字矿床模型为研究平台,以剥离岩石块体与排土场空置块体的赋值运算为基本方法,以排土运输总费用最小为目标,设计和研发了“剥-排对位算法”,对境界内每个待排岩石的排土路线和排土位置进行优化,对于通过科学计算指导排土计划优化,降低排土运输成本,提高企业经济效益具有重要作用。本文以采场和排土场的块体模型为研究基础,以排运总运费最小为目标,通过定义与假设若干条件,将总运费问题转化为求解最小总运距问题。以锥体模拟排土场排岩后的最终形态,提出以块体质心点为锥体顶点的锥体排除法来确定当前排土场的若干可排位置;基于锥体排除法和整体运距最小原理,在全境界采剥计划确定了剥离时空关系的基础上,建立了搜索境界内所有块体最小运距的“露天矿剥-排对位算法”。该算法的设计思路是将境界内每个原位块体按采剥顺序依次确定为目标块体,通过锥体排除法确定该目标块体在排土场若干可排位置,运用整体运距最小原理从若干可排位置中确定该目标块体的最优排土位置。本文基于“露天矿剥-排运对位算法”编制的计算机程序,对汽车运输排土和汽车-胶带混合运输排土两种类型的露天矿进行了最小运距逐年排土计划的解算,解算结果通过3DMine矿业软件可实现排运规划的三维可视化,并证明了解算结果的有效性和实用性。
[Abstract]:There is a theoretical optimal scheme for dumping transportation in open-pit mines, but limited by the complicated actual situation of stripping and discharging, the total cost of all rocks in the whole boundary can not be guaranteed to be minimized by using the existing algorithm. It is also impossible to determine the corresponding information of each rock to be discharged in the boundary, so it is difficult to be effectively used in the actual dumping transportation of mines. Based on the digital deposit model of opencast mine, this paper designs and develops a "peeling-alignment algorithm" based on the evaluation operation of stripped rock block and empty block in the dump, with the aim of minimizing the total cost of dumping transportation. The optimization of the drainage route and location of each rock to be discharged in the boundary is of great importance for guiding the optimization of the dumping plan by scientific calculation, reducing the transportation cost and improving the economic benefit of the enterprise. On the basis of block model of stope and dump, this paper takes the minimum total transportation cost as the goal, by defining and assuming some conditions, the problem of total freight is transformed into solving the problem of minimum total transportation distance. By using the cone to simulate the final shape of the discharged rock in the dump, a cone exclusion method with the core of the block as the apex of the cone is proposed to determine some rechargeable positions of the current dump. Based on the conical exclusion method and the principle of minimum total transportation distance, based on the determination of the space-time relationship of stripping in the whole boundary mining plan, an "opencast mine stripping and displacing algorithm" is established to search the minimum transport distance of all blocks in the boundary. The design idea of the algorithm is to determine each in-situ block in the boundary as the target block in the order of mining and stripping, and to determine the displacement position of the target block in the dump by the cone exclusion method. The optimal displacement position of the target block is determined by using the principle of minimum overall transportation distance from a number of deployable positions. Based on the computer program of "opencast mine stripping and displacement matching algorithm", this paper calculates the minimum transportation distance year by year for two types of open pit mine, automobile transport dump and automobile belt mixed transport dump. The results can be visualized by 3DMine mining software, and the validity and practicability of solving the results are proved.
【学位授予单位】：昆明理工大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TD57

【参考文献】