TRANSACTION PAPER

A zero-one integer programming model for open pit mining sequences

J. Gholamnejad

Department of Mining and Metallurgical engineering, Yazd University

SYNOPSIS

The aim of short-term production scheduling is to decide which blocks of ore and waste to mine in which time period (shift, days, weeks or months) so that several operational and geometrical constraints can be satisfied simultaneously. Since 1960s several mathematical programming approaches were developed for solving production scheduling problems that are based on a combination of various operational research approaches such as linear programming (LP), integer programming (IP), dynamic programming (DP), etc. A number of models have been developed in the past three decades but some models have limited application especially to geometrical mining constraints. One of the geometrical constraints is block accessibility. All blocks must be accessible to mining equipments on the same bench. In this paper a binary integer programming model is developed in order to incorporate block accessibility constraints in an efficient manner. This mathematical model insures that each block has been open and can be loaded and transported easily by shovels and trucks.

“Full text available only in PDF format”

References

1. SMITH, M.L. Optimization short-term production schedules in surface mining: Integrating mine modeling software with AMLP/CPLEX. International Journal of Surface Mining, Reclamation and Environmental, vol. 12, 1998, pp. 149-155.         [ Links ]

2. HUANG, S. Computer-based optimization of open pit mining sequences. Trans. Instn Min. Metall. (Sec A: Mining Industry), vol. 102, 1993. pp. A125-A133.         [ Links ]

3. WILKE, F.L. and REIMER, T.H. Optimizing the short-term production schedule for an open-pit iron ore mining system. Computer methods for the 80's in the mineral industry, Society of Mining Engineers of A.I.M.E, 1979. pp. 642-646.         [ Links ]