论文部分内容阅读
本文把确定露天矿优化设计境界视为一个大规模的线性规划问题,借助图论中的偶图,用求网络最大流的方法求解。采用搜索图确定各个方块的几何约束范围,所确定的境界既能满足露天矿空间几何形状及边坡各向异性的要求,又能达到经济上的优化。本文并以鞍山老岭露天矿为例,在编制程序中,采取了压缩存贮技巧和加快运算速度的措施,试算结果满意。
In this paper, it is considered as a large-scale linear programming problem to determine the optimal design of open-pit mine. With the help of the bipartite graph in graph theory, the maximum flow of network is used to solve the problem. The search map is used to determine the geometric constraint range of each block. The determined realm can not only meet the requirements of spatial geometry and slope anisotropy of opencast mine, but also achieve economic optimization. Taking Anshan Laoling Opencast Mine as an example, in the preparation process, we take the measures of compressing storage and speeding up the computing speed, and the trial results are satisfactory.