Direct sequencing of blocks in stochastic models with multi-mines and multi-destinations

Alex Miranda,Beck Nader

doi:10.1590/0370-44672018720181

Abstract

Abstract Mining Scheduling is the one that maximizes profit from mining over time. By means of computational methods, the deposit is discretized in blocks and algorithms are used to consummate this objective. The methods that are widely known nowadays for mining scheduling optimization of a discrete block model were based on graph theory, and among those most used by the mining industry is a solution found by Lerchs and Grossmann (1965) which, together with other methods, was consolidated as the process of traditional mining planning. For both supply and multi-destination models, there is a limitation of the current methodology, since it consists of the optimization of each mine separately which may not be a global optimization solution. This article proposes an optimization of the benefit in a stochastic model through the DBS (Direct Block Scheduling) for a copper mining complex with two mines, a pre-existing copper stockpile and two treatment streams, comparing several scenarios and analyzing the best alternative for the proposed problem.

Highlights

Linear programming techniques for mine scheduling were pioneered by Johson (1968)
Johson developed a mathematical model to solve the problem of long-term programming using the Dantzig-Wolfe - originally developed by American mathematicians George Dantzig and Phil Wolfe - (1960) principle that uses the algorithm for the decomposition of the complex master problem into subproblems
The algorithm of Lerchs and Grossmann (1965), for having its computational implementation performed by Whittle (1993), has been used by various mining planning packages ever since

Summary

Introduction

Linear programming techniques for mine scheduling were pioneered by Johson (1968). Johson developed a mathematical model to solve the problem of long-term programming using the Dantzig-Wolfe - originally developed by American mathematicians George Dantzig and Phil Wolfe - (1960) principle that uses the algorithm for the decomposition of the complex master problem into subproblems. The computational time for processing made this method impossible. The algorithm of Lerchs and Grossmann (1965), for having its computational implementation performed by Whittle (1993), has been used by various mining planning packages ever since. The process of scheduling the mining process involves the removal of at least two types of materials: ore and waste. The mining problem, can be modeled in terms of entire programming (HOCHBAUM e CHEN, 2000). The typical formulation of this model is as follows: b ∈ B: set of all B blocks

Methods

Results

Discussion

Conclusion