Dynamic Programming In Open Pit Mining Sequence Planning - A Case Study

An accepted approach to open pit mining sequence planning is one of computer aided planning where: the planner works out his mining sequences by trial and error using interactive graphics; This approach gives results that could in- variably be improved given more time for the planning exercise. Increased emphasis on interactive planning reveals a need for simple formalized procedures for improving mining sequence planning practices. This paper discusses a case study in which Dynamic Programming (DP) is used in mining sequence planning. It is shown that DP can be applied to identify various intermediate, pit boundaries. These are then arranged in descending order of economic values and their material contents analysed with respect to tonnages, grades, production requirements, and equipment capacities. Those increments which best satisfy defined conditions are selected and the others discarded. The mining sequence is thus built up as a chain of best- economic valued mining increments satisfying given production requirements and constraints.