Article

Ultimate Pit Limit Optimization using Boykov-Kolmogorov Maximum Flow Algorithm

Abstract

The ultimate pit limit optimization (UPLO) serves as an important step in the mine planning process. Various approaches of maximum flow algorithms such as pseudo-flow and push-relabel have been used for pit optimization, and have given good results. The Boykov-Kolmogorov (BK) maximum flow algorithm has been used in solving the computer vision problems and has given great practical results but it has never been applied in UPLO. In this work, we formulate and use the BK maximum flow algorithm and the push-relabel maximum flow algorithm in MATLAB Boost Graph Library within the MATLAB software in order to perform UPLO in two case studies. Comparing both case studies for the BK maximum flow algorithm and push-relabel maximum flow algorithm gives the same maximum pit values but the BK maximum flow algorithm reduces the time consumed by 12% in the first case and 16% in the second case. This successful application of the BK maximum flow algorithm shows that it can also be used in UPLO.

Figures (9)

  • Figure, page 1
    page 1
  • Figure, page 1
    page 1
  • Figure, page 1
    page 1
  • Figure 2. Active and passive nodes in the BK algorithm.
    Figure 2. Active and passive nodes in the BK algorithm.page 5
  • Figure 2. Active and passive nodes in the BK algorithm.
    Figure 2. Active and passive nodes in the BK algorithm.page 5
  • Figure, page 6
    page 6
  • Figure 5. Graph representing the block model. Figure 6. Graph showing the active nodes.
    Figure 5. Graph representing the block model. Figure 6. Graph showing the active nodes.page 6
  • Figure 11. Sections of the input code and data used for the ‘KD’ deposit.
    Figure 11. Sections of the input code and data used for the ‘KD’ deposit.page 8
  • Figure 13. Sections of the input code and data used for the ‘p4hd’ deposit.
    Figure 13. Sections of the input code and data used for the ‘p4hd’ deposit.page 9

Figures are taken from the article's full text; their rights belong to the authors and the publisher. Source: the article's original page

Similar items