A Mathematical Programming Framework For Stope and Production Scheduling Optimization: A Stochastic Integrated Approach
A Mathematical Programming Framework For Stope and Production Scheduling Optimization: A Stochastic Integrated Approach
i. Deterministic; and
ii. Stochastic
4 −$37,300 +149692
Expected Economic Block Value = = $70.29
7
7
Problem Definition
c) Production scheduling,
• Mining/extraction
• Processing
• Backfilling
• Stockpiling
11
Summary of Literature Review
• Mining/extraction schedule
• Processing schedule Production
scheduling
• Backfilling schedule
consideration
• Stockpiling management schedule
20
Assumptions
• To store ore that exceeds the current
processing plant capacity and is
reclaimed in the future.
Min + Min
S s =1 t =1 (1 + GDR)t S s =1 t =1 (1 + GDR)t
1 S
T ( SPpnCT t
jgdev t
) + ( SPpntCT t
jgdev t
s ,− )
Min
g ,+ s ,+ g ,−
S s =1 t =1 (1 + GDR)t
t
b - yst 0, s Gk ( S ), k {1,..., K };
t
k
t =1
t Precedence
y
t =1
t
k - bkt 0, k {1,..., K }; relations
K
SO
t
k , s k ,m k ,so ,s k ,so
k =1
(( o x t
) +
so =1
( o u t
) − odevs , + Tpr ,ub t {1,..., T }, s {1,..., S};
t
Processing
K
SO
t
capacity
k ,s k ,m k , so, s k , so
k =1
(( o x t
) +
so =1
( o u t
) + odevs,−
T t
pr ,lb
t {1,..., T }, s {1,..., S};
k ,m 1, k {1,..., K };
x t
t =1
Processing variable logic
so =1
t t t
t {1,..., T }, k {1,..., K }, s {1,..., S}; Grade capacity
control – Direct
K
t SO
t processing
( gr − g
pr ,lb k , s
k =1
) ( ok ,s x t
k ,m ) +
so =1
( gr t
pr ,lb − g t
k , so , s ) ( ok , so , s u t
k , so ) + gdevs , − 0,
t {1,..., T }, k {1,..., K }, s {1,..., S}
(( g
k =1
k ,s − grsit ,ub ) (ok , s ukt , si ) − jgdevst , + ) 0,
(( gr
k =1
t
si ,lb − g k , s ) (ok , s ukt , si ) + jgdevst , − ) 0,
t K t −1 K
t K t −1 K
(o
i=1 k =1
k , so , s g t
k , so , s u i
k , so ) (o
i =1 k =1
k ,s g k , s uki ,si ), t 1,..., T , s 1,..., S ;
t =1
31
Constraints - Primary Development
(d )
C
c ,ub t {1,..., T };
t t
cl d c L
c =1 Primary development
(d )
C
capacity
c ,lb t {1,..., T };
t t
cl d c L
c =1
t
b − d st ,l 0
t
c ,l
l (1,..., L), s Dc ( L);
t =1
Primary
t
t =1
- b t development
precedence
c 1, c {1,..., C};
d t
t =1
Primary development variable control
32
Constraints - Ventilation Development
vl Ventilation development
v =1
capacity
vl
v =1
t
b - d st ,l 0, l 1,..., L , s Dv ( L);
t
v ,l
t =1
t
Ventilation development
d
t =1
t
v ,l - b 0, l {1,..., L}, v 1,...,V ;
t
v ,l precedence
v 1, v {1,...,V };
d t
t =1
Ventilation development variable control
33
Constraints - Operational Development
(d )
A
a d t
a La ,ub , t {1,..., T };
t
a =1
Operational development
capacity
(d )
A
a d t
a La ,lb , t {1,..., T };
t
a =1
t
b - d st ,l 0, l {1,..., L}, s Da ( L);
t
a ,l
t =1
t
Operational
d
t =1
t
a ,l - bat ,l 0, l {1,..., L}, a {1,..., A}; development
precedence
bat ,l - bat +,l1 0, l {1,..., L}, t {1,..., T -1}, a {1,..., A};
t
Operational development
b - d at ,l 0, l {1,..., L}, k {1,...Kl }, a Da ( L);
t
k ,l
t =1 and mining precedence
T
t =1
34
Constraints – Ore pass Development
p
p =1 Ore pass development
capacity
(d d pt ) Ltp ,lb , t 1,..., T ;
P
p
p =1
t
b - d st ,l 0, l 1,..., L , s Dp ( L);
t
p ,l
t =1
t
Ore pass development
d tp,l - bpt ,l 0, l (1,..., L), p 1,..., P ;
t =1
precedence
t =1
35
Constraints – Backfilling
(d )
K
fv f k
t
V f ,ub , t {1,..., T };
t
k =1
Backfilling capacity
fv
k =1
t
f - ( xkt ,m + ukt , si ) 0, t {1,..., T }, k {1,..., K };
k
t
Backfilling precedence
t =1
f
t =1
k
t
1, k {1,..., K }; Backfilling variable logic
36
Constraints – Geotech stability
l lc , t {1,..., T };
lc t
l =1
N t Maximum allowable
activity – operational
t
1 M
t =1 M
x
m =1
t
k ,m - lelt 0, t {1,..., T }, l {1,..., L}, k Ll ( M );
Extraction activity
l le , t {1,..., T };
le
l =1
t
N t Maximum allowable
activity – extraction
k N xd
b t
t =1
Maximum allowable
extraction duration
38
Constraints – Non-Negativity
b , b , b , b , b , lc , le 0 and integers
t
k
t
c ,l
t
v ,l
t
a ,l
t
p ,l
t
l
t
l
• Six Scenarios
40
5 Number of levels 8
17
43
Block Model and Constraints
Fig. 11: Histogram for raw data and transformed normal score data of gold deposit
49
Variogram modelling (Cont’d)
Variogram Sill
Direction Azimuth (°) hmin (m) hmax (m) Nugget
model contribution
Vertical 0.0 Gaussian 0.5 3.5 5.9 0.5
Minor 112.5 Gaussian 0.5 3.5 5.9 0.5
Major 67.5 Gaussian 0.5 3.5 5.9 0.5
ɣ (h)
ɣ (h)
−3h 2
(h) = C. 1 − exp 2
ɣ (h)
a
Fig. 12: Experimental
Variograms Distance (m)
47
Table 2: Economic and technical data
Parameter Value
Scenario 3 – SMILP
2.33 3.05 7.19 7,601.30
without Stockpiling
Scenario 4 – SMILP
2.54 3.02 7.67 8,077.86
with Stockpiling
Scenario 5 – E-Type
2.29 2.77 6.39 7,036.10
without Stockpiling
Scenario 6 – E-Type
2.51 2.93 7.35 7,360.52
with Stockpiling
Case 2
MILP Model with Stockpiling
51
Results and Discussions – Case 2
Fig. 15: Direct processed material, material from stockpile and grade blended
curve schedule
56
Results and Discussions – Case 2 (Cont’d)
S5
S91
Case 4
SMILP Model with Stockpiling Strategy
• Stockpiling Strategy
60
Implementation of the Formulation
Table 5: Risk parameters for SMILP model
Parameter Cases 2
Number of realizations (#) 50
Fig. 22: Direct processed material, material from stockpile and grade blended
curve schedule
66
Results and Discussions – Case 4 (Cont’d)
Average
Ore tonnage Au metal NPV
Cases grade
(Mt) (t) (M$)
(g/t)
1 - (MILP) 2.52 2.87 7.23 7,801.20
2 - (SMILP) 2.54 3.02 7.67 8,077.86
Table 7: SMILP schedule comparison to MILP and E-type schedules based on random
realizations
Au
Ore Tonnage Average Grade NPV
Realization (R#) Schedule Type Metal
(Mt) (g/t) (M$)
(t)
MILP 2.58 3.34 8.11 7302
E-Type 2.46 3.25 7.87 7054
R1 SMILP 2.57 3.27 8.41 7398
E-Type comparison to SMILP (%) -4.28 -0.61 -6.42 -4.65
MILP comparison to SMILP (%) 0.39 2.14 -3.57 -1.29
MILP 2.41 3.31 8.12 7285
E-Type 2.40 3.24 7.88 6991
R30 SMILP 2.58 3.28 8.47 7329
E-Type comparison to SMILP (%) -7.06 -1.22 -6.97 -4.61
MILP comparison to SMILP (%) -6.67 0.91 -4.31 -0.59
MILP 2.52 3.25 7.87 7081
E-Type 2.49 3.16 7.63 6836
R40 SMILP 2.56 3.20 8.20 7223
E-Type Comparison to SMILP (%) -2.83 -1.25 -6.95 -5.35
MILP Comparison to SMILP (%) -1.66 1.56 -4.02 -1.97
Table 7: Sensitivity Analysis 1 – Au Price 75
Ore
Mining NPV Runtime
Run # Tonnage
Cost ($/t) ($) (hrs)
(Mt)
8,280
8258.18
8,260
8,240 8239.18
8,220
8,200 8194.68
NPV ($)
8,180
8,160
8139.32
8,140 8140.21
8,120
8,100 R² = 0.8023
8077.86
8,080
8,060
0 10 20 30 40 50 60
Number of Realizations
8,130 8118.4
R² = 0.8722 8115.00
8,120
8,110
8,100 8091.35
NPV ($)
8,090
8077.86
8,080
8,070
8,060
8,050 8048.00
8,040
0 10 20 30 40 50 60 70
GDR (%)
• Conferences
– Emmanuel J. A. Appianing & Eugene Ben-Awuah (2021), “A Mathematical Programming
Framework for Underground Open Stope Production Planning Optimization, CIM Virtual
Convention 2021
– Emmanuel J. A. Appianing, Obinna Mbadozie & Eugene Ben-Awuah (2024), “A Mixed
Integer Linear Programming (MILP) Framework for Open Stope Mining Production
Scheduling Optimization Considering Stockpiling Strategy”, WAIMM Geology, Exploration
and Mining Conference – GEM 2024
– Emmanuel J. A. Appianing, Obinna Mbadozie & Eugene Ben-Awuah (2024), “A
Stochastic Mixed Integer Linear Programming (SMILP) Framework for Open Stope Mining
Production Scheduling Optimization Considering Stockpiling Strategy”, 6th WAIMM Annual
Industry Conference – WAIC 2024
86
Acknowledgment
• External Examiner: Dr. Angelina Anani
• Supervisor: Dr. Eugene Ben-Awuah.
• Advisory committee members:
• Dr. Ming Cai
• Dr. Pawoumodom Takouda
• Dr. Marie-Helene Fillion
• Graduate coordinator: Dr. Ramesh Subramanian
• Industry colleagues
76
References
• MacNeil, J.A. and R.G. Dimitrakopoulos, A stochastic optimization formulation for the transition from open pit to underground
mining. Optimization and Engineering, 2017. 18(3): p. 793-813.
• Dimitrakopoulos, R. and S. Ramazan, Uncertainty based production scheduling in open pit mining. Society for Mining, Metallurgy,
and Exploration Transactions, 2004. 316(2004): p. 106-112.
• Dimitrakopoulos, R., C. Farrelly, and M. Godoy, Moving forward from traditional optimization: grade uncertainty and risk effects
in open-pit design. Mining Technology, 2002. 111(1): p. 82-88.
• Dimitrakopoulos, R. and S. Ramazan, Stochastic integer programming for optimising long term production schedules of open pit
mines: methods, application and value of stochastic solutions. Mining Technology, 2008. 117(4): p. 155-160.
• Vallejo, M.N. and R. Dimitrakopoulos, Stochastic orebody modelling and stochastic long-term production scheduling at the Kémag
iron ore deposit, Quebec, Canada. International Journal Mining, Reclamation Environment, 2019. 33(7): p. 462-479.
• Magagula, N.S., Stochastic characterisation of a mining production system, in Faculty of Engineering and the Built Environment.
2016, University of the Witwatersrand,: Johannesburg. p. 164.
• Noriega, R., Y. Pourrahimian, and E. Ben-Awuah, Optimisation of life-of-mine production scheduling for block-caving mines under
mineral resource and material mixing uncertainty. International Journal of Mining, Reclamation and Environment, 2022. 36(2): p.
104-124.
• Carpentier, S., M. Gamache, and R. Dimitrakopoulos, Underground long-term mine production scheduling with integrated
geological risk management. Mining Technology, 2016. 125(2): p. 93-102.
• Malaki, S., Block-cave extraction level and production scheduling optimization under grade uncertainty, in Department of Civil
and Environmental Engineering. 2016, University of Alberta: Edmonton. p. 157.
• Huang, S., et al., A stochastic mixed integer programming framework for underground mining production scheduling optimization
considering grade uncertainty. IEEE, 2020. 8(2020): p. 24495-24505.
• Mbadozie, O. and E. Ben-Awuah. Incorporating Grade Uncertainty in Oil Sands Mine Planning and Waste Optimization using
Stochastic Mathematical Programming. in 6th UMaT Biennial International Mining Conference. 2020. Tarkwa, Ghana: University
of Mines and Technology.
• Appianing, E.J.A., E. Ben-Awuah, and Y. Pourrahimian, Life-of-mine optimization for integrated open stope development and
production scheduling using a mixed-integer linear programming framework. Mining Technology, 2023. 132(2): p. 106-120.
Friendly questions are welcome.