مقاله

Dynamic Pit Tracker: An Iterative Heuristic Algorithm Tracing Optimized Solution for Ultimate Pit Limit and Blocks Sequencing Problem

چکیده

One of the most critical designs in open-pit mining is the ultimate pit limit (UPL). The UPL is frequently computed initially through profit-maximizing algorithms like the Lerchs-Grossman (LG). Then, in order to optimize net present value (NPV), production planning is executed for the blocks that fall within the designated pit limit. This paper presents a mathematical model of the UPL with NPV maximization, enabling simultaneous determination of the UPL and long-term production planning. Model behavior is nonlinear. Thus, in order to achieve model linearization, the model has been partitioned into two linear sub-problems. The procedure facilitates the model solution and the strategy by decreasing the number of decision variables. Naturally, the model is NP-Hard. As a result, in order to address the issue, the Dynamic Pit Tracker (DPT) heuristic algorithm was devised, accepting economic block models as input. A comparison is made between the economic values and positional weights of blocks throughout the steps in order to identify the most appropriate block. The outcomes of the mathematical model, LG, and Latorre-Golosinski (LAGO) algorithms were assessed in relation to the DPT on a two-dimensional block model. Comparative analysis revealed that the UPLs generated by these algorithms are consistent in this instance. Utilizing the new algorithm to determine UPL for a 3D block model revealed that the final pit profit matched LG UPL by 97.95%.

شکل‌ها (۷)

  • شکل، صفحه‌ی ۱
    صفحه‌ی ۱
  • شکل، صفحه‌ی ۱
    صفحه‌ی ۱
  • شکل، صفحه‌ی ۵
    صفحه‌ی ۵
  • Figure 21. The extraction sequence of the block model resulted from the new heuristic algorithm
    Figure 21. The extraction sequence of the block model resulted from the new heuristic algorithmصفحه‌ی ۱۷
  • Figure 22. The cumulative NPV graph resulted from the new algorithm
    Figure 22. The cumulative NPV graph resulted from the new algorithmصفحه‌ی ۱۷
  • Figure 24. The cumulative NPV graph for 3D block model
    Figure 24. The cumulative NPV graph for 3D block modelصفحه‌ی ۱۸
  • Figure 24. The cumulative NPV graph for 3D block model
    Figure 24. The cumulative NPV graph for 3D block modelصفحه‌ی ۱۸

شکل‌ها از متن کامل مقاله برداشته شده‌اند و حقوقشان از آنِ نویسندگان و ناشر است. منبع: صفحه‌ی اصلی مقاله

اسناد مشابه

  • a new algorithm for determining ultimate pit limits based on network optimization

    مقاله۲۰۱۳int. journal of mining & geo-engineeringali asghar khodayari

    one of the main concerns of the mining industry is to determine ultimate pit limits. final pit is a collection of blocks, which can be removed with maximum profit while following restrictions on the slope of the mine’s walls. the size, location and final shape of an open-pit are

  • A New Algorithm for Determining Ultimate Pit Limits Based on Network Optimization

    مقاله۲۰۱۳International Journal of Mining and Geo-EngineeringAli Asghar Khodayari

    One of the main concerns of the mining industry is to determine ultimate pit limits. Final pit is a collection of blocks, which can be removed with maximum profit while following restrictions on the slope of the mine’s walls. The size, location and final shape of an open-pit are

  • Ultimate Pit Limit Optimization using Boykov-Kolmogorov Maximum Flow Algorithm

    مقاله۲۰۲۱Journal of Mining and EnvironmentA. Mwangi, Z. Jianhua, H. Gang, R. Kasomo

    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) max