A Fast Algorithm To Solve The Ultimate Pit Limit Problem

In this paper we revisit the well known "Ultimate Pit Limit Problem" and suggest an alternative approach for fast and efficient solution. We follow the approach originally proposed by Johnson and Barnes (1988), but utilize the "Excess Scaling Algorithm" in solving the equivalent maximum flow problem. This algorithm provides significant increases in speed and reduction in memory requirements over the well known Labeling Algorithm of Ford and Fulkerson (1956), enabling one to solve large problems with relatively small computers. We present results of a series: of benchmark tests using this approach against the well known Lerchs Grossman algorithm as well as a brief description of the new algorithm.