Académique Documents
Professionnel Documents
Culture Documents
Abstract
In this work we present a methodological approach for finding near optimal solutions to the problem of defining plans for
underground mines. This problem of obvious combinatorial nature is intractable by means of traditional techniques
(Mixed Integer Programming for example). The approach proposed here is based in the mechanism of natural selection,
we construct a Genetic Algorithm to conduct the search of a approximate solution to the problem. In order to acquire
this objective, we first need a model which characterizes the gravitational flow of material from the drawpoints, the
chosen model for this objective is a cellular automata specifically designed with very simple rules of local evolution. The
model was implemented and tested, the time needed for a solution in real type cases is much less than the time human
planner needs actually for the same task. Possible extensions to this model are presented.
Algorithm.
Inputs:
Block Model
Location of Drawpoints
Population Size n
Parameters: Crossover and Mutation Probabilities
Iterations
Probabilities for Cellular Automata
Outputs:
Optimal Extraction Chart
Algorithm:
Initialize Extraction Charts Population
(n Extraction Charts):
P(0);
Fitness Evaluation(P(0));
For t = 0 To V FIG. 1: Best Individual Evolution.
Begin
Crossover (P(t)): P(t + 1); As we can see, the algorithm generates a sequence of
Mutation (P(t + 1)); solutions in which each one is at least equal or better than
Fitness Evaluation (P(t + 1)); the previous.
Next Generation Selection (P(t),P(t + 1));
End For B. Calibration of Model Parameters
In order to operate this GA, we need calibrate the
Function Fitness Evaluation(P(t)); functional parameters. The used example was the previous
For i = 1 To n one. We will vary crossover and mutation probabilities.
Begin To denote the instances of the problem we will use the
Simulate(Extraction Chart i(t)); notation An1/n2M, where n1 is crossover probability, n2
Cellular Automata(Extraction Chart i(t)); mutation probability, selection method A (Parents and Sons:
Economic Evaluation(Extraction Chart i(t)); PH; Only Sons: SH) and parent selection M (Roulette: R;
End For Drawing: S).
End Function
Each instance was runned 30 times and we determine in
V. NUMERICAL RESULTS which generation we reach the optimum. The following table
resumes the results.
A. Trivial Case
This case is a sector of 4 by 4 by 4 blocks, all of them with Instance Mean Standard Deviation
grade 0, i.e. sterile. This simple example has only two
extraction points, one in coordinates (1; 1; 0) and the other
in coordinates (3; 2; 0). The obvious solution to this problem PH80/20S 64.93 22.89
is to extract nothing from drawpoints. This example was PH90/30S 50.17 21.55
tested with the following parameters: PH80/30S 45.70 20.36
PH80/40S 38.33 20.33
Application Parameters PH80/50S 35.40 15.70
PH90/20S 61.13 27.64
Turn Number 5
PH100/20S 55.23 27.17
Max. Demand in each Turn 10 PH100/0S 100.00 0.00 (*)
PH100/100S 31.70 9.50
GA Parameters SH100/100S 100.00 0.00 (*)
SH80/20S 100.00 0.00 (*)
Iterations Number 100
PH100/100R 28.97 15.01
Population Size 10
Crossover Probability 0.8 (*) means that instance doesnt converge
Mutation Probability 0.2 never in 100 iterations.
We can extrapolate this result and see that in real [1] Eric Goles y Sebastin Pea: Modelamiento y
situations it would take about 8 hours to finish the Simulacin del Flujo Gravitacional. Informe Final PB5-
optimization process. 10004, Apndice N2, 1996.
[2] Gregorio Gonzlez: Estudio del Comportamiento de un
VI. EXTENSIONS TO THE MODEL Material Granular Mediante Modelos Computacionales.
Memoria para optar al ttulo de Ingeniero Civil
The proposed model dont consider downstream Matemtico, 1999.
operations. These operations are in general the most [3] John R. Koza: Genetic Programming: on the programming
restrictive operations. For example in some downstream of computers by means of natural selection, The MIT Press,
operations smooth ore grade is required, the fine mid term Cambridge, Massachussets, 1992.
promise has to be accomplished, etc. In all of these cases [4] Servet Martnez: Consideraciones Acerca del
the proposed model dont give an answer. Modelamiento de Flujo Gravitacional. Informe Final
PB5- 10004, Apndice N3, 1996.
Recently, an extension of the model proposed in this [5] Zbigniew Michalewicz: Genetic Algorithms + Data
paper have been implemented [10]. This model uses Structures = Evolution Programs, Springer, 1996.
Genetic Algorithms too and the main characteristics are: [6] Nelson Morales: Modelos Matemticos para
1. Genetic Algorithms mechanisms in the search of Planificacin Minera. Memoria para optar al ttulo de
solutions. Ingeniero Civil Matemtico, Universidad de Chile, 2002.
2. Mixture Models for Ore Unload. [7] Jos Saavedra: Secuencias, Flujo Gravitacional y
3. Operations are considered as transport problem. Evolucin en Planificacin Minera. Memoria para optar
4. Restrictions on the quantity of ore to be extracted from al ttulo de Ingeniero Civil Matemtico, Universidad de
drawpoints are imposed. Chile, 2002.
5. Capacity constraints in downstream operations are [8] Marco Alfaro, Jos Saavedra: Predictive Models for
considered. Gravitational Flow. To be presented in MassMin 2004.
6. NPV evaluation. [9] Carlo Caldern, Marco Alfaro, Jos Saavedra:
7. Drawpoint Grade behavior is assumed. Computational Model for Simulation and Visualization of
Gravitational Flow. To be presented in MassMin 2004.
In real type situations, the response time of this [10] Andrs Donoso: Modelos para la Planificacin
implementation are in the order of 3:00 hrs [10]. Operacional de Produccin en Minera Subterrnea.
The next challenge is to integrate the model proposed in Memoria para optar al ttulo de Ingeniero Civil
[7] whit the one proposed in [10]. Both models were Industrial, Universidad de Los Andes, 2004.