General Approach To Distribute Waste Rocks Between Dump Sites in Open Cast Mines
General Approach To Distribute Waste Rocks Between Dump Sites in Open Cast Mines
General Approach To Distribute Waste Rocks Between Dump Sites in Open Cast Mines
= i
i
D
day
ton
, D
1
=1,000
day
ton
, D
2
=2,000
day
ton
, D
3
=5,000
day
ton
, D
4
=4,000
day
ton
0000 , 12
3
1
=
= j
j
W
day
ton
, W
1
=6,000
day
ton
, W
2
=4,000
day
ton
, W
3
=2,000
day
ton
Finally, the scenario must formulate to linear programming problem from contextual
problem. There is one objective function in the above model that made from table 5:
X
ij
equals daily tonnage that must remove from the excavator (W
i
) to the dump (D
j
).
Objective function:
Min Z = 12.86X
11
+ 16.07X
12
+ 25.72X
13
+ 19.29X
14
+ 19.29X
21
+ 16.07X
22
+ 12.86X
23
+ 9.64X
24
+ 12.86X
31
+ 6.43X
32
+ 16.07X
33
+ 22.50X
34
, X
ij
0
Subject to:
X
11
+ X
12
+ X
13
+ X
14
+ 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 = 6,000
0 + 0 + 0 + 0 + X
21
+ X
22
+ X
23
+ X
24
+ 0 + 0 + 0 + 0 = 4,000
0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + X
31
+ X
32
+ X
33
+ X
34
= 2,000
X
11
+ 0 + 0 + 0 + X
21
+ 0 + 0 + 0 + X
31
+ 0 + 0 + 0 = 1,000
0
+ X
12
+ 0 + 0 + 0 + X
22
+ 0 + 0 + 0 + X
32
+ 0 + 0 = 2,000
0
+ 0 + X
13
+ 0 + 0 + 0 + X
23
+ 0 + 0 + 0 + X
33
+ 0 = 5,000
0
+ 0 + 0 + X
14
+ 0 + 0 + 0 + X
24
+ 0 + 0 + 0 + X
34
= 4,000
A decision maker could not actually solve the problem yet, but it is formulated as linear
programming problem that the objective is to minimize costs. Linear programming
problems have to be solved by computer usually. We can solve them using Mathematica
software.
Mathematica is a general computing environment, organizing many algorithmic,
visualization, and user interface capabilities within a document-like user interface
paradigm. Besides addressing nearly every field of classical mathematics, it provides
cross-platform support for a wide range of tasks such as numerical computation and
operations research. The Mathematica attempts to uniformly capture all aspects of
mathematics and computation, rather than just specialized areas.
The linear programming problem should be formatted as the input of information into
the Mathematica package.
The mining scenario is summarized as a Mathematica form below:
Clear[x, A, b, c, Xvec]
Xvec = Table[x[i, j], {i, 1, 3}, {j, 1, 4}];
c = {12.86, 16.07, 25.72, 19.29, 19.29, 16.07, 12.86, 9.64, 12.86, 6.43, 16.07, 22.50};
b = {6000, 4000, 2000, 1000, 2000, 5000, 4000};
A = {{1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0,0}, {0, 0, 0, 0, 0, 0,
0,0,1, 1, 1, 1}, {1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0}, {0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0}, {0, 0, 1,
0, 0, 0, 1, 0, 0, 0, 1, 0}, {0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1}};
Xvec = LinearProgramming[c, A, b]
c is a goal vector, b is a constraint vector, and A is a coefficients matrix. The
decision vector is earned after running program.
10
The decision vector is {1000, 1000, 0, 4000, 0, 0, 4000, 0, 0, 1000, 1000, 0}.
The decision vector allocates a quantity of waste to each of the dump site. The results
of this study are given in table 6.
Table 6: The waste allocation table to the dumps
D
1
D
2
D
3
D
4
Dump
Face
day
ton
day
ton
day
ton
day
ton
Sum
W
1
1,000 1,000 0 4,000 6,000
W
2
0 0 4,000 0 4,000
W
3
0 1,000 1,000 0 2,000
Sum 1,000 2,000 5,000 4000 12,000
There are three breasts the interior of waste (W
1
, W
2
, and W
3
) in this scenario. The
daily product rate is 6,000 ton from W
1
. This amount must share among the dumps based
on results (table 6). One thousand tons of waste rocks are consigned to the D
1
and another
one thousand tons of waste rocks are also consigned to the D
2
. Finally, four thousand tons
of waste rocks that were excavated from W
1
, were sent to D
4
. This producer can be
generalized to other dumps.
Conclusion
Since most activities generally involve processing a relatively large quantity of rock to
recover a relatively small amount of valuable product, large quantities of waste are
produced as a by-product. By-products must haulage to the dumps based on intake
capacities and available facilities in the dump sites, such as the bulldozers to level the
ground and distributing the waste evenly over the land. It is very important that the
transport cost must be reduced to a minimum.
Limitations of conventional approaches have necessitated the development of new
approach specifically for large haulage equipment.
Cost estimation and linear programming can produce an accurate model of haulage
operations in surface mining and can be used to predict the operational performance that
will result from changes to the mine layout or system upgrades.
This method provides a flexible platform for the development of such computer
simulations. In the case presented modeling of a haulage operation has enabled
alternative designs to be evaluated and compared at an early stage and the influence of a
wide range of parameters, such as truck numbers, truck capacity, haulage times and
passing bay spacing, to be investigated.
References
[1] Hartman Howard, Introductory mining engineering, John Wily&Sons, Canada, 2002.
[2] Oraee Kazem, Analysis of productivity, Ketab Marv, Iran, 1998.
[3]Oraee Kazem, Engineering economy, Hormozgan University, Iran, 2001.
[4]Azar Adel, Concepts and linear programming applications, Nashr Elm, Iran, 2000
[5]Razavi Mehdi, Introduction to: operations Research, I.R.T.C.I., Iran, 2006.
11