Application of push-relabel and heuristics to open pit mines
The pit limit problem is crucial to mine planning. The use of computer models to design ultimate open pit limits is becoming increasingly popular. One solution method adopted is to transform the pit limit problem to a maximum flow network. A popular maximum flow technique is push relabel. The purpos...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
2009
|
| Online Access: | http://hdl.handle.net/2429/5693 |
| Summary: | The pit limit problem is crucial to mine planning. The use of computer models to design ultimate open pit limits is becoming increasingly popular. One solution method adopted is to transform the pit limit problem to a maximum flow network. A popular maximum flow technique is push relabel. The purpose of this thesis is twofold. The first is to check if push relabel algorithm performs better than other MF algorithms on real, rather than randomly generated data (as in the past). The second is to develop and test heuristics that can take advantage of the characteristics of the open pit mine network structure to further renhance the push relabel routine. |
|---|