A Dynamic Programming Algorithm for Selecting Evenly Spaced Pushbacks from Nested Pits

Nested pit analysis in open-pit long range mine planning is used to define approximate ultimate pit limits and an initial high-level schedule in the early stages of a project. Modern ultimate pit optimizers can solve for dozens, or even hundreds, of nested pits however often a smaller subset of pits which are evenly spaced with respect to contained tonnage are desired for downstream analysis. In situations where that pushback selection process must be automated, such as when performing sensitivity analysis, or when the best subset of pushbacks is required; an optimization procedure is warranted. This paper describes a dynamic programming algorithm for selecting pushbacks following nested pit analysis, which is performant and addresses a long-standing inconvenience faced by long range open-pit mine planners.