Optimization of Surface Mining Dig Limits with a Practical Heuristic Algorithm

This paper presents an algorithm for optimizing the classification of surface mine material subject to excavating constraints. High-resolution expected profit models are input and optimized to classification maps subject to site-specific rectangular excavating constraints. This optimization problem...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mining engineering Jg. 36; H. 4; S. 773 - 784
Hauptverfasser: Vasylchuk, Y. V., Deutsch, C. V.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cham Springer International Publishing 01.08.2019
Society for Mining, Metallurgy, and Exploration, Inc
Schlagworte:
Algorithms
Classification
Computer simulation
Constraint modelling
Engineering
Exact solutions
Heuristic
Heuristic methods
High resolution
Materials Engineering
Metallic Materials
Mineral Resources
Mining
Optimization
Resolution
Selectivity
Surface mining
Dig-limit optimization
Grade control
Simulation
Heuristic algorithm
Modeling
Open-pit mining
ISSN:2524-3462, 0026-5187, 2524-3470
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents an algorithm for optimizing the classification of surface mine material subject to excavating constraints. High-resolution expected profit models are input and optimized to classification maps subject to site-specific rectangular excavating constraints. This optimization problem defies traditional closed-form analytical solutions; a practical heuristic algorithm has been developed to quickly determine the optimal final destination for the material subject to realistic constraints. The optimization is fast and generates results that achieve up to 98–99% of the total expected profit achieved with free selection. This algorithm provides a fast viable option for practical application in short-term grade control and in managing multiple realizations in long-term resource estimation.
ISSN:2524-3462
0026-5187
2524-3470
DOI:10.1007/s42461-019-0072-8