LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
复制标题
DOI：
10.1016/j.cor.2007.12.006
复制
发表时间：
2009-04-01
影响因子：
4.6
通讯作者：
Gleixner, Ambros M.
中科院分区：
文献类型：
--
作者：
Boland, Natashia;Dumitrescu, Irina;Gleixner, Ambros M.
Given a discretisation of an orebody as a block model. the open pit mining production scheduling problem (OPMPSP) consists of finding the sequence in which the blocks should be removed from the pit., over the lifetime of the mine, such that the net present value (NPV) of the operation is maximised. In practice. due to the large number of blocks and precedence constraints linking them, blocks are typically aggregated to form larger scheduling units. We aim to solve the OPMPSP, formulated as a mixed integer programme (MIP), so that aggregates are used to schedule the mining process, while individual blocks are used for processing decisions. We propose an iterative disaggregation method that refines the aggregates (with respect to processing) up to the point where the refined aggregates defined for processing produce the same optima I solution for the linear programming (LP) relaxation of the MIP as the optimal solution of the LP relaxation with individual block processing. We propose several strategies of creating refined aggregates for the MIP processing, using duality results and exploiting the problem structure. These refined aggregates allow the solution of very large problems in reasonable time with very high solution quality in terms of NPV. (C) 2007 Elsevier Ltd. All rights reserved.
