Scribd
Upload
20 views9 pages

4.1. Moving Cone Algorithm

Uploaded by

Claude babacar sambou
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views9 pages

4.1. Moving Cone Algorithm

Uploaded by

Claude babacar sambou
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Moving cone algorithm

• The floating cone or moving cone method is an


approach to pit limit optimization problems just like
the maximum flow algorithm, the Lerchs-Grossman
algorithm and many others.

• It was first developed by Carlson, Erickson, O’Brain


and Pana in 1966.
• In a given 2D set of blocks representing the deposit
distribution, each block has an economical value, the
purpose is to find the set of block that will yield the
maximum profit and still meet pit slope angle
constraints.
• Unlike the maximum flow and the Lerchs-Grossman
algorithms, the floating cone method is not based on
graph theory. It is an heuristic technique (experience
based).
• This approach is the simplest and most common
alternative to the Lerchrs-Grossman algorithm
• Advantages : Easy to use , requires significantly less
computing time than any other method
• Disadvantage : The outcome is not always the true
optimum pit.
• Improved versions of the floating cone algorithm have
been developed to overcome its disadvantages
• The methods consist in creating, for each positive block , a cone (with
sides respecting the pit slope angle constraints) containing all the
overlying blocks that must be mined in order to get this positive block.
The value of the cone is then determined by summing the value of
blocks encloses in it. If that value is positive, every block of the cone is
mined. Otherwise, the cone is not mined.
• The process starts at the surface (first level of blocks) and moves
downwards searching for ore blocks (positive value) until no positive
cones remain.
Example
• On the first level, the only positive block is block (1,6). The block is mined
1 2 3 4 5 6 7

1
-2 -2 -2 -2 -2 2 -2
2
-1 2 -2 7 -3 -1 -1
3
-3 -1 6 2 -1 -2 -3

• On the second level, one positive block is block (2,4). Its extracting cone has
a positive
1 2value,
3 hence
4 the5 cone6 is mined.
7 1 2 3 4 5 6 7

1
-2 -2 -2 -2 -2 -2 -2 -2 -2 -2 -2 -2
2
-1 2 -2 7 -3 -1 -1 -1 2 -2 7 -3 -1 -1
3
-3 -1 6 2 -1 -2 -3 -3 -1 6 2 -1 -2 -3
• The process continues as follows
1 2 3 4 5 6 7 1 2 3 4 5 6 7

1
-2 -2 -2 1
-2 -2 -2
2
-1 2 -2 -3 -1 -1 2
-1 2 -2 -3 -1 -1
3
-3 -1 6 2 -1 -2 -3 3
-3 -1 6 2 -1 -2 -3
1 2 3 4 5 6 7 1 2 3 4 5 6 7

1
-2 -2 -2 1
-2 -2 -2
2
-1 2 -2 -3 -1 -1 2
-1 2 -2 -3 -1 -1
3
-3 1 6 2 -1 -2 -3 3
-3 -1 6 2 -1 -2 -3
1 2 3 4 5 6 7 1 2 3 4 5 6 7

1
-2 -2 -2 1
-2 -2 -2
2
-1 2 -2 -3 -1 -1 2
-1 2 -2 -3 -1 -1
3
-3 -1 6 2 -1 -2 -3 3
-3 -1 6 2 -1 -2 -3

Final pit outline

1 2 3 4 5 6 7

1
-2 -2 -2 -2 -2 2 -2
2
-1 2 -2 7 -3 -1 -1
3
-3 -1 6 2 -1 -2 -3
Assignment
• Find the ultimate pit limit using the moving cone algorithm

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy