Abstract
Determining the optimum ultimate-pit limits can be justified when analysing low-grade and/or inhomogeneous surfacial deposits. Such deposits require investigations of a range of ultimate pits for correct economic judgement. A prerequisite for such economic analyses is a fast and accurate method for determining the multiple pit shells to be analysed. Dynamic Programming (DP) offers an advantageous alternative to both the Lerchs—Grossman algorithm and the moving-cone method, for the design of the multiple pits required for such economic sensitivity analyses. This paper examines some of the practical aspects involved in using dynamic programming for ultimate pit design (UPD). The basics are discussed and some DP proposals are reviewed. The question of the optimum ultimate pit versus the practical need for generating acceptable non-optimum pits, using minimum computing times and core storage, is examined. Results from tests with various refinements of the 3-dimensional dynamic programming approach for ultimate pit design proposed by Wilke and Wright are discussed. The indication is that ultimate-pit results, which, in terms of total economic values, are no worse than those designed by the moving-cone method, can be obtained with the modified approaches using only fractions of the computing times required by the moving-cone method.
Published Version
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