A New Graph Theory Algorithm For Optimal Ultimate Pit Design

To generate a most profitable ultimate pit limit is generally the first step in mine design. This paper presents a new graph theory oriented, optimum ultimate pit limit design algorithm which will maximize the total undiscounted net profit. This algorithm performs much better than the well known Lerchs-Grossmann algorithm, in terms of the reduction in computation time and computer memory requirements. This algorithm operates on many directed trees in a graph, where each vertex in a tree represents a block in the mine model. The formation of each directed tree is based more on the ore-waste support concept than the geometry constraints alone. The general procedures of the algorithm, programming considerations and two case study results are discussed in the paper.