Authors: Yashar Pourrahimian; Hooman Askari-Nasab; Dwayne Tannant
Addresses: Mining Optimization Laboratory (MOL), School of Mining and Petroleum Engineering, Department of Civil and Environmental Engineerings, University of Alberta; 3-133 Markin/CNRL Natural Resources Engineering Facility, Edmonton, Alberta, T6G 2W2, Canada ' Director of Mining Optimization Laboratory (MOL), School of Mining and Petroleum Engineering, Department of Civil and Environmental Engineering, University of Alberta; 3-133 Markin/CNRL Natural Resources Engineering Facility, Edmonton, Alberta, T6G 2W2, Canada ' School of Engineering - UBC Okanagan campus, University of British Columbia
Abstract: Relying only on manual planning methods or computer software based on heuristic algorithms will lead to mine schedules that are not the optimal global solution. The objective of this paper is to develop a practical optimisation framework to schedule production for caving operations. We present two Mixed-Integer Linear Programming (MILP) formulations for the long-term production scheduling of block caving. First, we solve the problem at the drawpoint level. Then, we aggregate drawpoints into larger units referred to as clusters. The formulations are developed, implemented and verified in the TOMLAB/CPLEX environment. The production scheduler aims to maximise the Net Present Value (NPV) of the mining operation while the mine planner has control over the development rate, vertical mining rate, lateral mining rate, mining capacity, maximum number of active drawpoints and advancement direction. Application and comparison of the models for production scheduling using real mine data over 15 periods are presented.
Keywords: block caving; mixed integer linear programming; MILP; production scheduling; aggregation; CPLEX; mine schedules; mining; optimisation.
International Journal of Mining and Mineral Engineering, 2012 Vol.4 No.1, pp.26 - 49
Published online: 16 Jul 2012 *Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article