A sliding time window heuristic for open pit mine block sequencing
A sliding time window heuristic for open pit mine block sequencing
复制标题
DOI：
10.1007/s11590-011-0306-2
复制
发表时间：
2011-08-01
影响因子：
1.6
通讯作者：
Newman, Alexandra
中科院分区：
文献类型：
--
作者：
Cullenbine, Christopher;Wood, R. Kevin;Newman, Alexandra
The open pit mine block sequencing problem (OPBS) seeks a discretetime production schedule that maximizes the net present value of the orebody extracted from an open-pit mine. This integer program (IP) discretizes the mine's volume into blocks, imposes precedence constraints between blocks, and limits resource consumption in each time period. We develop a "sliding time window heuristic" to solve this IP approximately. The heuristic recursively defines, solves and partially fixes an approximating model having: (i) fixed variables in early time periods, (ii) an exact submodel defined over a "window" of middle time periods, and (iii) a relaxed submodel in later time periods. The heuristic produces near-optimal solutions (typically within 2% of optimality) for model instances that standard optimization software fails to solve. Furthermore, it produces these solutions quickly, even though our OPBS model enforces standard upper-bounding constraints on resource consumption along with less standard, but important, lower-bounding constraints.
