Optimized open pit mine design, pushbacks and the gap problem—a review
- 1 May 2014
- journal article
- review article
- Published by Pleiades Publishing Ltd in Journal of Mining Science
- Vol. 50 (3) , 508-526
Abstract
Existing methods of pushback (phase) design are reviewed in the context of “gap” problems, a term used to describe inconsistent sizes between successive pushbacks. Such gap problems lead to suboptimal open pit mining designs in terms of maximizing net present value. Methods such as the Lerchs-Grossman algorithm, network flow techniques, the fundamental tree algorithm, and Seymour’s parameterized pit algorithm are examined to see how they can be used to produce pushback designs and how they address gap issues. Areas of current and future research on producing pushbacks with a constrained size to help eliminate gap problems are discussed. A framework for incorporating discounting at the time of pushback design is proposed, which can lead to mine designs with increased NPV.Keywords
This publication has 14 references indexed in Scilit:
- Stochastic mine production scheduling with multiple processes: Application at Escondida Norte, ChileJournal of Mining Science, 2013
- A New Algorithm for the Open-Pit Mine Production Scheduling ProblemOperations Research, 2012
- Optimal life-of-mine scheduling for a Bauxite mineJournal of Mining Science, 2011
- Sequence optimization in longwall coal miningJournal of Mining Science, 2011
- Stochastic optimization for strategic mine planning: A decade of developmentsJournal of Mining Science, 2011
- Moving forward from traditional optimization: grade uncertainty and risk effects in open-pit designMining Technology: Transactions of the Institutions of Mining and Metallurgy, 2002
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problemsAnnals of Operations Research, 1995
- Maximal Closure of a Graph and Applications to Combinatorial ProblemsManagement Science, 1976
- Graph Theory with Applications1976
- Decomposition Principle for Linear ProgramsOperations Research, 1960