Production scheduling under uncertainty of an open-pit mine using Lagrangian relaxation and branch-and-cut algorithm
Department of Geological and Mining Engineering and Sciences
The life-of-mine optimization of open pit mine production scheduling under geological uncertainty is a computationally intensive process. Production scheduling determines the optimal extraction sequence by maximizing net present value (NPV). In this paper, an algorithm is proposed to schedule an open pit mine under geological uncertainty, where instead of solving the whole problem at once, the production schedule is generated by sequentially solving sub-problems. The sub-gradient method is used to generate the upper bound solution of a Lagrangian relaxed sub-problem. If the upper bound relaxed solution is infeasible, a mixed integer programming is applied to the latter solution. The algorithm is validated by solving six problems and is compared to the linear relaxation of the original production scheduling problem. The results show that the proposed algorithm generates a solution that is very close to optimal, with less than a 3% optimality gap. An application at a copper mine, where geological uncertainty is quantified with geostatistical simulations of the related orebody, shows that all constraints are satisfied and an 11% higher NPV is generated when compared to the corresponding deterministic equivalent of the proposed approach, while a 26% higher NPV is generated compared to a common conventional industry approach.
International Journal of Mining, Reclamation and Environment
Production scheduling under uncertainty of an open-pit mine using Lagrangian relaxation and branch-and-cut algorithm.
International Journal of Mining, Reclamation and Environment.
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/579