论文部分内容阅读
露天矿代化设计的实质是以计算机为基础去实施一种适用于矿体三维块段模拟的算法。勒奇斯和格罗斯曼于1965年发表的第一个计算机算法开创了运筹学在矿业中应用的一个最为活跃的领域。虽然这种算法至少已有25年是求得最优露天矿形状的唯一可证明的严格方法，然而，在矿业中仍然未能获得广泛应用。可是，它几乎被普遍视为据以对照评价一切其它算法的基准。勒奇斯-格罗斯曼算法所以迟迟不能采用的最主要的原因是它在应用与实施方面的实际困难：编程有困难，很难容纳边坡变化和运输道路布置等约束条件，运算时间长以及方法难于理解。主要出于这些原因，寻求新算法的工作经久不衰。很早就显示出发展前途的勒奇斯-格罗斯曼算法的一个变种是科罗勃夫算法。然而，按其原始型式，这种算法并不能保证在一切场合获得最优解。我们先综观一下露天矿最优设计算法的发展情况和现状，然后将给出一种算法。在矿体各特定部分的边坡预先定义好之后，它能将边坡变化情况自动地结合到勒奇斯-格罗斯曼算法和科罗勃夫算法中去。接着介绍一种能保证得出最优解的科罗勃夫算法的改进方法。因此，提供了一种优于勒奇斯-格罗斯曼算法的方法。科罗勃夫改进算法虽然是一种试探法，但可以证明是一种最优方法。同时，它是一种简单易懂的?
The essence of the open-pit mine design is computer-based to implement an algorithm that is suitable for the simulation of three-dimensional block of ore body. The first computer algorithms published by Lachis and Grossman in 1965 pioneered one of the most active areas in operations research for operations research. Although this algorithm has been the only demonstrable and rigorous method of determining the shape of an open-pit mine for at least 25 years, it has not been widely used in mining. However, it is almost universally regarded as the benchmark against which all other algorithms are evaluated. The most important reason why the delay of the Leachs-Grossman algorithm can not be used is its practical difficulties in application and implementation: it is difficult to program, it is difficult to accommodate constraints such as slope changes and road layout, and the operation time is long And the method is difficult to understand. For these reasons, the search for new algorithms has been enduring. A variant of the Leachs-Grossman algorithm that showed long-term development is the Corolbo algorithm. However, in its original form, this algorithm does not guarantee the optimal solution in all situations. We first look at the development of the optimal design of open-pit mine and the status quo, and then will give an algorithm. After pre-defining the slope of a particular part of the ore body, it automatically integrates the slope changes into the Leach-Grossman and Corobov algorithms. Then introduce an improved method to ensure Corolynov algorithm to get the optimal solution. Therefore, a method that is superior to the Leach-Grossman algorithm is provided. Although Corrobov’s improved algorithm is a heuristic, it can prove to be an optimal method. At the same time, it is a simple and easy to understand?