Innovative Optimization of Iron Ore Blending in Daily Mine Planning From A Linear Programming Model
Innovative Optimization of Iron Ore Blending in Daily Mine Planning From A Linear Programming Model
programming model
Vidal Félix Navarro Torresª, Edilaila Moraesb
a
Vale Institute of Technology, Belo Horizonte, Minas Gerais, Brazil, [email protected]
b
Vale S.A, Belo Horizonte, Minas Gerais, Brazil, [email protected]
Abstract: This work aims to develop models and algorithms to mine planning to explore opportunities for better use
of mineable reserves, seeking to optimize economic and quality objectives, in an integrated way. The research
methodology aims to understand the mine planning processes and tools applied, and to identify requirements that guide
the development of mathematical models to support the decisions to reuse opportunity materials (i.e. materials before
considered as waste can be reevaluated due to changes in mining plans, processing technologies more evolved, increase
in commodity prices, etc.) and minimizing the variability of ROM grades in short-term planning. Analysis of
operational configurations that support greater flexibility in the handling and storage of opportunity materials were
also held in order to enable an objective comparison between the economic benefits of the approach and the costs and
investments involved.
30
around the monthly average and lower daily
variation. Subject to the following constraints:
The proposed model seeks to maximize the ROM −
𝑦𝑗𝑘 ≥ −𝑀(1 − 𝑧𝑗𝑘 ) ∀𝑗, 𝑘 (11)
mass supplied in a plan, by selecting ore blocks +
𝑦𝑗𝑘 ≥ −𝑀𝑧𝑗𝑘 ∀𝑗, 𝑘 (12)
presented in a set that represents the planning ∑𝑘 𝑦𝑖𝑘 = 1 ∀ 𝑖 ∈ 𝐵 (13)
horizon, according to the following objective ∑𝑖 𝑚𝑖 𝑦𝑖𝑘 ≤ 𝑢 ∀𝑘 (14)
function:
𝑦𝑖𝑘 ∈ {0,1} ∀𝑖 ∈ 𝐵 (15)
𝑚𝑎𝑥 ∑𝑖 𝑚𝑖 𝑦𝑖 (1)
𝑧𝑗𝑘 ∈ {0,1} ∀𝑗, 𝑘 (16)
Subject to the following constraints:
∑𝑖 𝑡𝑖𝑗 𝑚𝑖 𝑦𝑖 3.2. Application development
∑𝑖 𝑚𝑖 𝑦𝑖𝑘
≤ 𝑙𝑗 ∀ 𝑗 ∈ 𝑄 − (2)
∑𝑖 𝑡𝑖𝑗 𝑚𝑖 𝑦𝑖 Two different tools were developed.
≥ 𝑙𝑗 ∀ 𝑗 ∈ 𝑄 + (3)
∑𝑖 𝑚𝑖 𝑦𝑖 a) Maximize the overall mass of ore from the set
Where: of blocks available in the planning horizon.
k: 1, 2, ... K: periods (for daily schedule, K = 30); The weighted average of the quality of
mi: block mass i ∈ B; selected blocks must meet the quality
tij: grade of j ∈ (Q+ ∪ Q− ) present in the block i ∈ specifications of the power plant.
B; b) Minimize the daily variability of feeding the
lj : limit of j ∈ (Q+ ∪ Q− ) in the total mass; processing plants, by determining the optimal
yik: selection of block i ∈ B in the period k, yik ∈ {0, sequence of exploitation of certain blocks in
1}. the mining plan.
This objective function seeks to maximize the total
selected mass from the available blocks in the plan. For both approaches described above, the final
The lower daily variation around the monthly product comprises an integrated set of technologies
average approach uses the following objective to facilitate the use. The models were implemented
function: using Python programming language, in connection
𝑤𝑗 ∑𝑖 𝑡𝑖𝑗 𝑚𝑖 𝑦𝑖𝑘 with the solver Gurobi through the API available for
𝑚𝑎𝑥 ∑𝑗 𝐾
∑𝑘 |
∑𝑖 𝑚𝑖 𝑦𝑖𝑘
− 𝑙𝑗 | (4)
that language. The models were integrated into an
Where wj is the relative importance of the parameter Excel spreadsheet through SolverStudio supplement.
j ∈ (Q+ ∪ Q−) compared with the other, as wj ∈ [0, This is the spreadsheet user interface, and use is
1] and Pj wj = 1 where the parameters and input data is defined for the
Subject to the following constraints: problem.
∑𝑘 𝑦𝑖𝑘 = 1 ∀ 𝑖 ∈ 𝐵 (5)
∑𝑖 𝑚𝑖 𝑦𝑖𝑘 ≤ 𝑢 ∀𝑘 (6)
𝑦𝑖𝑘 ∈ {0,1} ∀𝑖 ∈ 𝐵, 𝑘 (7)
The objective function aims to minimize the sum of
the daily quality deviations related to the monthly
average, for each parameter. The constrains require
that each block only could be used once in the
considered plan, and guarantee that the daily feed
capacity of the processing plant have not be
exceeded.
The next formulation do not allow that large variation
occur from one day to another, this formulation seeks
to minimize the average daily variation, in order to
minimize impacts on the processing plant. The lower
daily variation approach use the following objective
function:
+
𝑦𝑗𝑘 = ∑𝑖 𝑡𝑖𝑗 𝑚𝑖 𝑦𝑖𝑘 − ∑𝑖 𝑡𝑖𝑗 𝑚𝑖 𝑦𝑖𝑘−1 ∀𝑗, 𝑘 (8)
−
𝑦𝑗𝑘 = ∑𝑖 𝑡𝑖𝑗 𝑚𝑖 𝑦𝑖𝑘−1 − ∑𝑖 𝑡𝑖𝑗 𝑚𝑖 𝑦𝑖𝑘 ∀𝑗, 𝑘 (9)
𝑤𝑗 Figure 1 Application integrated interface running to solve
+ −
𝑚𝑖𝑛 ∑𝑗 ∑𝑘(𝑦𝑗𝑘 + 𝑦𝑗𝑘 ) (10) the optimization model
𝐾
31
3.3. Application on real cases
32
Figure 6 Total monthly mass in the sequence determined
Figure 4 Daily variation of contents, for Mine 2 by the model for the Mine 2
33
metal uncertainty,” Journal of the Operational http://brasilminingsite.com.br/includes/modulos/mdl
Research Society, vol. 65, pp. 1305-1314, 2014. _artigo/exibir_artigo.php?id=24, 2008.
[3] F. A. R. do Carmo, A. Curi e W. T. de Sousa, [7] J. Amaya, D. Espinoza, M. Goycoolea, E.
“Otimização econômica de explotações a céu Moreno, T. Prevost e E. Rubio, “A scalable approach
aberto,” Revista Escola de Minas, vol. 59, n. 3, 2006. to optimal block scheduling,” em Application of
[4] E. Rubio, “Planificación Minera: Desafíos y Computers and Operations Research in the Mineral
Nuevas Tendencias en la Industria Minera,” em Industry (APCOM), Vancouver, 2009.
Primer Taller de Planificación Minera, Santiago, [8] F. A. R. do Carmo, “Metodologias para o
Chile, 2009. Planejamento de Cavas Finais de Minas a Céu Aberto
[5] A. C. Girodo e J. L. Beraldo, “Elementos Básicos Otimizadas,” Ouro Preto, 2001.
de um Projeto de Mineração,” em Curso Projetos de
Mineração, Belo Horizonte, Instituto Brasileiro de Artículo recibido: 16.10.2019
Mineração, 1981.
Aceptado en: 04.11.2019
[6] A. C. Campos, J. Valente e A. C. Girodo,
“Parametrização Multivariável de Recursos e
Reservas,” Brasil Mining Site, n.
34