Lerchs-Grossmann Algoritmen
Lerchs-Grossmann Algoritmen er en grafteoretisk metode til at bestemme den ultimative grube-grænse i åbne mineoperationer. Introduceret af Helmut Lerchs og Israel Grossmann i 1965, maksimerer den nutidsværdien af udvundet malm, samtidig med at den respekterer begrænsninger for skråningsstabilitet. Denne algoritme danner det teoretiske grundlag for de fleste moderne software til grubeoptimering.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
Kilder
- Lerchs, H., & Grossmann, I. F. (1965). Optimum design of open-pit mines. Canadian Mining and Metallurgical Bulletin, 58(633), 47-54. link ↗
- Johnson, T. B. (2014). Optimum pit limits - definition and computational procedures. Journal of the Australasian Institute of Mining and Metallurgy, 249, 21-28. link ↗
Sådan citerer du denne side
ScholarGate. (2026, June 3). Lerchs-Grossmann Algorithm for Open Pit Mine Design. ScholarGate. https://scholargate.app/da/mining-engineering/lerchs-grossmann-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Lanes Cut-off Grade ModelMinedrift↔ compare
- Mine ventilationMinedrift↔ compare
- Pseudoflow AlgoritmenMinedrift↔ compare
- Optimering af Stope-layoutMinedrift↔ compare
Refereret af
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →