Abstract

One of the main stages in design of mineral development process is solution of finding optimal open pit problem. It is necessary to take into account the spatial distribution of mineral components and the allowable slope angles of the sides during solving this problem. The basis for performing calculations to optimize the extraction of reserves is a digital block model of the mineral deposit. The larger and more accurate block model of the ore deposit requires more computationally complex calculation process. In this regard, using of parallel computing in this area is very relevant. The importance of solving this problem determined by the need to have an accurate model of the open pit at various stages of its development. This model depends from current cost of useful components and the costs of their extraction. This task formulated as the Ultimate Pit Problem (UPIT). Existing approaches for solving this problem does not use modern high-performance computing approaches. This complicates analysis of large models using existing methods. The long data processing time makes it difficult to increase the accuracy of the constructed quarry models, which in turn negatively affects decision-making on the field development plan and entails lost profit. In this paper analysed the methods of computer modelling open pits from the position of parallelizing computations during profit optimization and proposes a mathematical formulation of the problem of searching for open pit limits based on block extraction order graph.

Highlights

  • As a rule, the interpretation of information about the occurrence and patterns of distribution of useful components in the field is carried out on a limited amount of geological exploration data

  • It is necessary to take into account the spatial distribution of mineral components and the allowable slope angles of the sides during solving this problem

  • The basis for performing calculations to optimize the extraction of reserves is a digital block model of the mineral deposit

Read more

Summary

Introduction

The interpretation of information about the occurrence and patterns of distribution of useful components in the field is carried out on a limited amount of geological exploration data. It is only natural that the larger and more accurate the block model of the ore deposit is, the more computationally complex is the calculation process In this regard, the use of modern means of parallel computing in this area is very relevant. The long data processing time makes it difficult to increase the accuracy of the constructed quarry models, which in turn negatively affects the decision-making on the field development plan and entails lost profit In this regard, the use of modern means of high-performance computing in the field of solving the problems of optimizing the shape of opencast mining pits is relevant. The task of developing new methods and parallel algorithms for finding the boundaries of quarries of ore deposits is relevant

Theoretical Foundations of the Ultimate Pit Problem
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call