Integrated Parametric Graph Closure and Branch-and-Cut Algorithm for Open Pit Mine Scheduling under Uncertainty

Mining

Devendra Joshi¹  Sk Md Equeenuddin²  Snehamoy Chatterjee³  Amol Paithankar⁴ 

[1] Department of Computer Science & Engineering, Koneru Lakshmaiah Education Foundation, Vaddeswaram, Vijayawada 522502, Andhra Pradesh, India;Department of Earth and Atmospheric Sciences, National Institute of Technology, Rourkela 769008, Odisha, India;Department of Geological and Mining Engineering and Sciences, Michigan Technological University, Houghton, MI 49931, USA;Global Resource Engineering Ltd., Denver, CO 80203, USA;

关键词: open pit mine;    production scheduling;    geological uncertainty;    net present value;    graph closure;   

DOI  :  10.3390/mining2010003

来源: DOAJ

【 摘 要 】

Open pit mine production scheduling is a computationally expensive large-scale mixed-integer linear programming problem. This research develops a computationally efficient algorithm to solve open pit production scheduling problems under uncertain geological parameters. The proposed solution approach for production scheduling is a two-stage process. The stochastic production scheduling problem is iteratively solved in the first stage after relaxing resource constraints using a parametric graph closure algorithm. Finally, the branch-and-cut algorithm is applied to respect the resource constraints, which might be violated during the first stage of the algorithm. Six small-scale production scheduling problems from iron and copper mines were used to validate the proposed stochastic production scheduling model. The results demonstrated that the proposed method could significantly improve the computational time with a reasonable optimality gap (the maximum gap is 4%). In addition, the proposed stochastic method is tested using industrial-scale copper data and compared with its deterministic model. The results show that the net present value for the stochastic model improved by 6% compared to the deterministic model.

【 授权许可】

Unknown