A metaheuristic dual interchange algorithm (DIA) for optimising long-term production scheduling in open-pit mine planning APCOM 2021

The Southern African Institute of Mining and Metallurgy
R. A. Phillips M. M. Ali C. Musingwini
Organization:
The Southern African Institute of Mining and Metallurgy
Pages:
15
File Size:
908 KB
Publication Date:
Sep 1, 2021

Abstract

The long-term open-pit mine production scheduling problem (OPMPSP) is typically solved in two broad stages. The first stage entails optimisation of the ultimate pit limit, which delimits the economical final pit and maximises the undiscounted value of the deposit. The second stage entails optimisation of the long-term open-pit mine production scheduling, which maximises the discounted value of the deposit. The long-term OPMPSP is a type of an NP-hard problem, such as the travelling salesman problem (TSP), because it is intrinsically complex to solve since it incorporates both hard and soft constraints. Therefore, metaheuristic approaches have been used to find global optimum solutions to the long-term OPMPSP. This paper presents a metaheuristic approach utilising a dual interchange algorithm (DIA) to solve the long-term OPMPSP. The DIA is a parent algorithm which supervises two subservient algorithms, namely, simulated annealing (SA) and Tabu search (TS). The DIA selects the better solution generated in each run from the two algorithms, and simultaneously penalises the algorithm that produced an inferior solution, while rewarding the one that produced a better solution. The DIA was tested on the three-dimensional Arizona Copper Deposit (KD) dataset, which is publicly available for research purposes from the online MineLib repository. It was set to generate net present values (NPVs) in five-minute intervals and the solution improved until it plateaued at about 30 minutes of runtime. The NPVs compared favourably to those obtained on the same KD dataset but obtained over 24-hour runtimes, when solved using simulated annealing and Tabu search algorithms, and the NPV generated from the work of Muñoz (2012) using the modified TopoSort as found on the MineLib repository at the time of this study. Therefore, this paper demonstrates that DIAs can be developed and used to solve the three-dimensional long-term OPMPSP.
Citation

APA: R. A. Phillips M. M. Ali C. Musingwini  (2021)  A metaheuristic dual interchange algorithm (DIA) for optimising long-term production scheduling in open-pit mine planning APCOM 2021

MLA: R. A. Phillips M. M. Ali C. Musingwini A metaheuristic dual interchange algorithm (DIA) for optimising long-term production scheduling in open-pit mine planning APCOM 2021. The Southern African Institute of Mining and Metallurgy, 2021.

Export
Purchase this Article for $25.00

Create a Guest account to purchase this file
- or -
Log in to your existing Guest account