An Application of Branch and Cut to Open Pit Mine Scheduling |
| |
Authors: | Louis Caccetta Stephen P. Hill |
| |
Affiliation: | (1) School of Mathematics and Statistics, Curtin University of Technology, GPO Box U1987, PERTH, Western Australia, 6845 (E-mail |
| |
Abstract: | The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed. |
| |
Keywords: | Branch and Cut Mixed Integer Linear Programming Mine Scheduling Optimization |
本文献已被 SpringerLink 等数据库收录! |