Using Integer Programming for Strategic Underground and Open Pit-to-Underground Scheduling

Similar documents
Determination of the transition point from open pit to underground mining

An improved formulation of the underground mine scheduling optimization problem when considering selective mining

Practical long-term planning in narrow vein mines a case study

Time Aggregation for Network Design to Meet Time-Constrained Demand

SIMO CASE STUDY GEOVIA USER CONFERENCE PERTH CHRIS JAMES 31 MAY 2018

MINERAL RESOURCE AND ORE RESERVE UPDATE PAMPALO GOLD MINE

Oposura Scoping Study Nearing Completion

Optimisation of Cut-Off Grade at Mount Isa Mines Limited s Enterprise Mine

Open-pit mining problem and the BZ algorithm

STANDARD DEFINITIONS

Application of the GeoSequencing Module to ensure optimised underground mine schedules with reduced geotechnical risk

INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 7, ISSUE 3, MARCH 2018 ISSN

Solving Mixed-Integer Nonlinear Programs

Introduction to Geology and Geometallurgy

Coburn Zircon Project

MODELING (Integer Programming Examples)

OPTIMIZATION OF PRODUCTION PLANNING IN UNDERGROUND MINING

METHODS FOR IMPROVING THE TRACTABILITY OF THE BLOCK SEQUENCING PROBLEM FOR OPEN PIT MINING

Petra Diamonds Limited Resource Statement

Prospect Resources completes rehabilitation and mine construction at the Prestwood Gold Mine - moving into production mode

June 4, 2015 News Release Valley of the Kings Underground Infill Drilling Underway

Solving Railway Track Allocation Problems

A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling

For personal use only

Trouser Legs Mine Strong Drilling Results - including g/t Au Potential for Further Mine Development

Mineral reserves and resources

July 15, 2015 News Release Valley of the Kings Underground Infill Drilling Progresses

King of the Hills Gold Project, Leonora, to commence production in Q2 2011

QUITO PROJECT. December Northwest Mining Association Annual Conference. Austin, Nevada BVA:TSX.V BRT: FSE

News Release DRILLING STEPPED UP AT FORRESTANIA NICKEL PROJECT AND UPDATE ON DIGGERS SOUTH PRE - FEASIBILITY STUDY

HYBRID FLOW-SHOP WITH ADJUSTMENT

MILP reformulation of the multi-echelon stochastic inventory system with uncertain demands

Evaluation of Mineral Resource risk at a high grade underground gold mine

On Clearing Coupled Day-Ahead Electricity Markets

Boliden Mine Automation

LINEAR PROGRAMMING MODULE Part 1 - Model Formulation INTRODUCTION

Column Generation for Extended Formulations

Practical Tips for Modelling Lot-Sizing and Scheduling Problems. Waldemar Kaczmarczyk

Strategic Phase 2 Exploration Program Launched at Island Gold High-Grade Resource Potential Identified Laterally and at Depth

is called an integer programming (IP) problem. model is called a mixed integer programming (MIP)

FUTORES II Augmenting Prospectivity Analysis with Mining Criteria: A Test for Viability

LINEAR PROGRAMMING APPROACH FOR THE TRANSITION FROM MARKET-GENERATED HOURLY ENERGY PROGRAMS TO FEASIBLE POWER GENERATION SCHEDULES

YANFOLILA EXPLORATION 2018

For personal use only

GLOUCESTER COAL LTD 2006 Annual Results Media Presentation 25 August 2006

Integer Programming Formulations for the Minimum Weighted Maximal Matching Problem

CONTINUING GOLDEN LEGACY

Operator assignment problem in aircraft assembly lines: a new planning approach taking into account economic and ergonomic constraints

New Drilling Program Commences at Mutiny s Deflector Deposit

Mineral reserves and resources

ITASCA Consulting Canada Inc.

Multi-Area Stochastic Unit Commitment for High Wind Penetration

AMUR MINERALS CORPORATION (AIM: AMC) April 2018 Mining Potential Update

Mimosa regional locality map. Mimosa. Mimosa. Ngezi. Shurugwi. Zvishavane. North. Hill. Ngezi. South. Hill. Wedza Mine. Mtshingwe 20 21'S 20 14'S

Effective Continuous-Time Formulation for Short-Term Scheduling. 3. Multiple Intermediate Due Dates 1,2

October 8, 2015 News Release Brucejack Regional Drilling Intersects Over 8,000 Grams Per Tonne Gold

Mineral reserves and resources

Papua New Guinea University of Technology Department of Mining Engineering Lesson Plan MN 332 Mining Geology

Maximum Flow Problem (Ford and Fulkerson, 1956)

Composition of the crust. Ore deposits. Ore distribution. Resources: Mineral resources. Reading: Today: Ch 12 (to p306)

Mineral resources. Composition of the crust. Resources: Reading: Today: Ch 12 (to p306) QUESTION Environmental Geology Mineral resources

ASX/Media Announcement

WHAT IS MINERAL EXPLORATION?

For personal use only

Facility Location and Distribution System Planning. Thomas L. Magnanti

A column generation approach to the discrete lot sizing and scheduling problem on parallel machines

NEWS RELEASE. FOR IMMEDIATE RELEASE Shares Outstanding: 35,190,286

Lecture 22 Integer Linear Programming Prototype Examples. November 2, 2009

MANDALAY RESOURCES CORPORATION INCREASES MINERAL RESOURCES AND RESERVES AT ITS BJÖRKDAL GOLD MINE

Institutional Control Registry - Report

Geostatistical Determination of Production Uncertainty: Application to Pogo Gold Project

Discrete lot sizing and scheduling on parallel machines: description of a column generation approach

Linear Programming. H. R. Alvarez A., Ph. D. 1

Using column generation to solve parallel machine scheduling problems with minmax objective functions

The Discovery of the Phoenix: New High-Grade, Athabasca Basin Unconformity Uranium Deposits Saskatchewan, Canada

A Mathematical (Mixed-Integer) Programming Formulation for. Microbrewery. Spyros A. Reveliotis. Spring 2001

Introduction 3. Basic Mine Fill Materials 13

An Optimization Approach to the Preventive Maintenance Planning Process

CS 580: Algorithm Design and Analysis. Jeremiah Blocki Purdue University Spring 2018

An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

For personal use only

Hello, my name is P.D. and I am going to take you on an adventure that will help you answer the question, What is a Mine? LET S GO!

Non-cyclic Train Timetabling and Comparability Graphs

Orbital Conflict. Jeff Linderoth. Jim Ostrowski. Fabrizio Rossi Stefano Smriglio. When Worlds Collide. Univ. of Wisconsin-Madison

Mineral Resources: A CRIRSCO/CP Perspective

The Tactical Berth Allocation Problem with Quay-Crane Assignment and Transshipment Quadratic Costs

Tutorial 2: Modelling Transmission

Krasny license: Operational update February 2016

Balogo Exploration Update

University of Saskatchewan

Three-partition Flow Cover Inequalities for Constant Capacity Fixed-charge Network Flow Problems

QUEEN SHEBA - RESOURCE TABLE: AUGUST 2011 RESOURCE CATEGORY. Tonnes Au Ag Cu (000) g/t g/t % GLOBAL RESOURCE TABLE: CONTAINED METAL

Multi-Skill Resource-Constrained Project Scheduling: Formulation and Inequalities

NEW DISCOVERIES AT THE RED OCTOBER MINE

The new sulphide mineralization lies within a 1.4 kilometer long east-west trending

MSA 640 Homework #2 Due September 17, points total / 20 points per question Show all work leading to your answers

New High Grade Lode Discovered at Wagtail South

Press Release Thunder Bay: August 2, 2018

MARCH 2010 QUARTERLY REPORT

Gestion de la production. Book: Linear Programming, Vasek Chvatal, McGill University, W.H. Freeman and Company, New York, USA

Transcription:

Using Integer Programming for Strategic Underground and Open Pit-to-Underground Scheduling Barry King Advisor: Alexandra Newman Operations Research with Engineering PhD Program August 5-6, 2016

Cutoff Grade Introduction 2 Mining companies must make the distinction between ore and waste material, cutoff grade Cutoff grade signifies the degree of mineralization below with material will not be processed into a salable product Our research determines the cutoff grade that maximizes the NPV of a planned underground mine

Cutoff Grade Mine Design 3 Stopes are constructed on a regular grid Width and length of a stope may vary within a fixed minimum and maximum value Height of the stopes is equal on every level Height Level Z Y X

Cutoff Grade Mine Design 4 Open Pit South Central Upper North Central Deeps The mine is separated into mining zones and each mining zone may possess its own cutoff grade

Cutoff Grade Mine Design 5

Cutoff Grade Mine Design 6 Sequencing Rules: 1 Stopes in the left corridor are extracted increasing by slot number and stopes in the right corridor are extracted decreasing by slot number 2 If multiple stopes exist at the same level-slot location, they are extracted in order of economic value 3 A stope may not be extracted unless the stope(s) directly above have been completely extracted

Cutoff Grade Solution Strategy 7 We enumerate all cutoff-grade triples, which we define as a permutation of the 16 cutoff grade options, 1 to 7 by 0.4, for the South, Central, and North Zone. Fast solutions times for each cutoff-grade triple The OMP Solver (Rivera et al., 2015) can quickly solve the linear programming relaxation of the UG-PSP strategic formulation TopoSort can create near-optimal integer solutions to UG-PSPs in seconds (Chicoisne et al., 2012; King et al., 2016b) Ability to bound the objective function value for each solve Linear programming relaxation objective function value provides an upper bound Integer solution objective function value provides a lower bound

Cutoff Grade Original Schedule Cutoff grades are 3.8, 3.4, and 3.0 units per tonne for the South, Central, and North Zones, respectively Integer Programming gap of 0.11% and an NPV of 85.53 8 Creating an integer programming solution to the linear programming relaxation with the largest objective function value results in a schedule that cannot be implemented.

Cutoff Grade Adjusted Schedule 9 We adjust the resource constraints to prevent the North Zone from extracting stopes until year 9, and this results in more desirable production levels Cutoff grades remain at 3.8, 3.4, and 3.0 units per tonne for the South, Central, and North Zones, respectively NPV is only 1.8% lower than that of the Original Schedule

Cutoff Grade Solution Information Cutoff-grade triple instances, on average, contain 31,575 variables and 230,117 constraints Linear programming relaxation solution time of each cutoff-grade triple averages 8.10 seconds Minimum and maximum solution times are 1.59 and 19.02 seconds, respectively Parallel computation allows us to solve all of 4,096 linear programming relaxations in 43 minutes 10

Cutoff Grade Conclusions Outline a methodology for producing the optimal cutoff grade for multiple mining zones by using an integer program Exploit the mathematical structure of the problem to solve the linear programming relaxation efficiently using the OMP Solver Provide three distinct improvements to the current method for selecting the cutoff grade 1 Determines an upper bound on NPV as opposed to using a heuristic 2 Updating the data and rerunning of our model requires a few days, contrary to the six to eight weeks it takes to rerun the mining company s model 3 Schedules the entire mine and selects the optimal cutoff grade for multiple zones rather than considering only a single zone 11

Transition Introduction Mineral deposits may extend across a large vertical expanse Mining industry desires a methodology to determine which areas of the deposit to extract via open pit or underground mining methods Mine planners are forced to schedule the open pit and underground mines separately Transition Zone 12

Transition - Open Pit Design Open pit is separated into (aggregated) blocks Blocks contain bins of (i) waste, (ii) low-, (iii) medium-, and (iv) high-grade ore Each phase-block-bin combination has its own stockpile Material from each bin can be sent to the mill, to a stockpile, or to a waste location Block Phase 1 Mill Phase 2 Phase 3 Waste Low Grade Med. High Grade Grade 13

Transition Warehouse-Style Stockpiling Standard Inventory Balance Constraint Material in the stockpile at the start of the next time period = Material currently in the stockpile - Material sent from stockpile to mill + Material added to the stockpile S S S I S + (Y S = Inbt Inb,t+1 nb2t Ynb2,t 1 ) nbt b B, n Nb, t T 14

Transition Reformulation: Inventory Balance We can reformulate the stockpiling to precedence relationship by placing all of the material in a stockpile before processing Equivalent to the original constraint under the assumptions: No value lost for placing material in inventory No handling costs associated with placing or retrieving material Reformulated Constraint Amount of Material Sent to Processing Amount of Material Extracted Z S nbt Ŷ S bt b B, n N b, t T 15

Transition Underground Mine Introduction Open stope mining method using Modified-Avoca sequencing Stopes are constructed in an regular grid Development position and length are estimated 16

Transition Crown and Sill Pillars A crown pillar is a layer of rock left between the bottom of the open pit and the top of the underground mine for saftey A sill pillar is a level of stopes left in situ to provide a false bottom in an underground mine Levels are horizontal expanses of rock whose height is equal to a maximum height of the stope 17

Transition Crown Pillar Formulation Indices and sets: v V set of crown pillar elevations b B v set of blocks that exist below the crown pillar if the crown pillar is located at elevation v ã Ã v set of activities that exist above the crown pillar if the crown pillar is located at elevation v Decision variables: Wv Tb 1 if the crown pillar is located at elevation v; 0 otherwise Xat U 1 if activity a is completed by the end of time t; 0 otherwise 1 if block b is completed by the end of time t; 0 otherwise X S bt Constraints: X S bt 1 Wv Tb Xat Ũ 1 W Tb v V v W Tb v = 1 b B v, v V, t T ã Ã v, v V, t T 18

Transition Removing or Precedence Enumerating crown and sill pillar locations allows us to remove the or precedence constraints whose presence drastically increases the solve time Open Pit Transition Zone Open Pit Transition Zone Underground Underground Underground Transition Zone Open Pit 19

Transition Model Variables: Open pit block extraction time period Open pit block processing time period Underground activity completion time period Objective Function: Maximize NPV Constraints: Blocks and activities can be completed once Precedence constraints for both the open pit and underground mine are maintained Capacity constraints for the open pit mine, underground mine, and processing plant are met 20

Transition Solver Comparison Summary of annual production capacities for the operational metal mine Annual Capacities Annual Extraction Development Discount Open Pit (t) Underground (t) (m) Mill (t) Rate 50,000,000 2,000,000 5000 8,000,000 9% Crown pillar located at an elevation of 820 meters above sea level and a sill pillar located at level 460 CPLEX (12.6) OMP Solver Barrier Simplex LP Solution TopoSort Percentage Time (sec) Time (sec) Time (sec) Time (sec) Gap 163.75 488.41 9.72 3.59 2.78% Models are solved on a Dell PowerEdge R410 machince with 16 processors (2.72 GHz each) and 28 GB of RAM 21

Transition LP and IP Enumeration Results 22

Transition Final Results Best known IP objective function value had a 2.51% gap Crown pillar placement was at elevation 820 and a sill pillar located on level 500 Serial solution time to solve over 3500 LP relaxations and to obtain a near-optimal IP solution in 8 hours and 15 minutes Fully parallelized the problem can be solved in 39.75 seconds 23

Transition Model: Indices and sets b B n N b ˆb ˆB b p P b a A ǎ Ǎ a p P a r R t T blocks b bins in block b blocks that must be mined directly before block b predecessors for block b that must be completed at least one time period in advance of block b set of all underground activities set of fixed predecessors for activity a predecessors for activity a that must be completed at least one time period in advance of activity a resources (1 =open pit mine, 2 = mill, 3 = sinking rate, 4 = underground mine capacity, 5 = backfill capacity, 6 = development capacity) time periods 24

Transition Model: Data c S nb c S+ nb q S rnb mining cost for bin n in block b [$/tonne] revenue generated after having milled bin n of block b [$/tonne] quantity of resource r consumed by bin n of block b [1 & 2 = tonnes] ca U monetary value associated with completing activity a [$] qra U quantity of material requiring extraction associated with activity a [2, 4 & 5 = tonnes, 6 = meters] r rt, r rt minimum, maximum amount of resource r available in time t [1 & 2 = tonnes, 3 = blocks, 4 & 5 = tonnes, 6 = meters] discount factor for time period t (fraction) δ t 25

Decision Variables Xbt S Ŷbt S Znbt S Xat U 1 if block b has finished being extracted by the end of time t; 0 otherwise fraction of block b extracted and sent to the stockpile by the end of time t fraction of bin n in block b sent to the mill by the end of time t 1 if activity a is completed by the end of time t; 0 otherwise Objective Function: Maximize Net Present Value max δ t c S+ nb qs 2nb (Z nbt S Z nb,t 1 S ) b B n N b t T δ t c S b qs 1nb (Ŷ bt S Ŷ b,t 1 S ) + δ t ca U (Xat U Xa,t 1) U t T a A t T b B 26

Transition Model: Constraints Ensure that each completed activity or block remains completed Xb,t 1 S Xbt S b B, t T Ŷb,t 1 S Ŷ bt S b B, t T Znb,t 1 S Znbt S b B, n N b, t T Xa,t 1 U Xat U a A, t T Enforce the precedence structure Xbt S Ŷ bt S Ŷbt S X Sˆpt Znbt S Ŷ bt S Xat U X Uˇpt b B, t T b B, ˆp ˆP b, t T b B, n N b, t T a A, ˇp ˇP a, t T 27

Transition Model: Constraints Ensure that one time period elapses between the completion of two specific activities or blocks Ŷbt S Ŷ S p,t 1 b B, p P b, t T Xat U Xp,t 1 Ū a A, p P a, t T Bounds open pit-specific resource use r 1t q1nb(ŷ S bt S Ŷ b,t 1) S r 1t t T b B n N b Restricts the mill capacity r 2t b B n N b q 2nb S (Z nbt S Z nb,t 1 S )+ q2a(x U at U Xa,t 1) U r 2t t T a A Bounds underground-specific resource consumption r rt a A q U ra(x U at X U a,t 1) r rt r R, r 4, t T 28