TY - JOUR
T1 - A framework for adaptive open-pit mining planning under geological uncertainty
AU - Lagos, Tomás
AU - Armstrong, Margaret
AU - Homem-de-Mello, Tito
AU - Lagos, Guido
AU - Sauré, Denis
N1 - Funding Information:
This research has been supported by grant Programa de Investigación Asociativa (PIA) ACT1407, Chile. Guido Lagos also acknowledges the financial support of FONDECYT Grant 3180767, Chile. Tito Homem-de-Mello and Tomás Lagos acknowledge the support of FONDECYT Grant 1171145, Chile. Denis Saure acknowledges the support of FONDECYT Grant 1181513. Acknowledgements
Publisher Copyright:
© 2020, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2022/3
Y1 - 2022/3
N2 - Mine planning optimization aims at maximizing the profit obtained from extracting valuable ore. Beyond its theoretical complexity—the open-pit mining problem with capacity constraints reduces to a knapsack problem with precedence constraints, which is NP-hard—practical instances of the problem usually involve a large to very large number of decision variables, typically of the order of millions for large mines. Additionally, any comprehensive approach to mine planning ought to consider the underlying geostatistical uncertainty as only limited information obtained from drill hole samples of the mineral is initially available. In this regard, as blocks are extracted sequentially, information about the ore grades of blocks yet to be extracted changes based on the blocks that have already been mined. Thus, the problem lies in the class of multi-period large scale stochastic optimization problems with decision-dependent information uncertainty. Such problems are exceedingly hard to solve, so approximations are required. This paper presents an adaptive optimization scheme for multi-period production scheduling in open-pit mining under geological uncertainty that allows us to solve practical instances of the problem. Our approach is based on a rolling-horizon adaptive optimization framework that learns from new information that becomes available as blocks are mined. By considering the evolution of geostatistical uncertainty, the proposed optimization framework produces an operational policy that reduces the risk of the production schedule. Our numerical tests with mines of moderate sizes show that our rolling horizon adaptive policy gives consistently better results than a non-adaptive stochastic optimization formulation, for a range of realistic problem instances.
AB - Mine planning optimization aims at maximizing the profit obtained from extracting valuable ore. Beyond its theoretical complexity—the open-pit mining problem with capacity constraints reduces to a knapsack problem with precedence constraints, which is NP-hard—practical instances of the problem usually involve a large to very large number of decision variables, typically of the order of millions for large mines. Additionally, any comprehensive approach to mine planning ought to consider the underlying geostatistical uncertainty as only limited information obtained from drill hole samples of the mineral is initially available. In this regard, as blocks are extracted sequentially, information about the ore grades of blocks yet to be extracted changes based on the blocks that have already been mined. Thus, the problem lies in the class of multi-period large scale stochastic optimization problems with decision-dependent information uncertainty. Such problems are exceedingly hard to solve, so approximations are required. This paper presents an adaptive optimization scheme for multi-period production scheduling in open-pit mining under geological uncertainty that allows us to solve practical instances of the problem. Our approach is based on a rolling-horizon adaptive optimization framework that learns from new information that becomes available as blocks are mined. By considering the evolution of geostatistical uncertainty, the proposed optimization framework produces an operational policy that reduces the risk of the production schedule. Our numerical tests with mines of moderate sizes show that our rolling horizon adaptive policy gives consistently better results than a non-adaptive stochastic optimization formulation, for a range of realistic problem instances.
KW - Adaptive algorithms
KW - Geostatistics
KW - Iterative learning algorithm
KW - Mine planning
KW - Stochastic optimization
UR - http://www.scopus.com/inward/record.url?scp=85090768506&partnerID=8YFLogxK
U2 - 10.1007/s11081-020-09557-0
DO - 10.1007/s11081-020-09557-0
M3 - Article
AN - SCOPUS:85090768506
SN - 1389-4420
VL - 23
SP - 111
EP - 146
JO - Optimization and Engineering
JF - Optimization and Engineering
IS - 1
ER -