SciELO - Scientific Electronic Library Online

 
vol.121 número3Reliability and evaluation of point load index values obtained from different testing devices índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Articulo

Indicadores

Links relacionados

  • En proceso de indezaciónCitado por Google
  • En proceso de indezaciónSimilares en Google

Compartir


Journal of the Southern African Institute of Mining and Metallurgy

versión On-line ISSN 2411-9717
versión impresa ISSN 2225-6253

Resumen

SARI, Y.A.  y  KUMRAL, M.. Clustering-based iterative approach to stope layout optimization for sublevel stoping. J. S. Afr. Inst. Min. Metall. [online]. 2021, vol.121, n.3, pp.97-106. ISSN 2411-9717.  http://dx.doi.org/10.17159/2411-9717/1237/2021.

Underground mining operations tend to have higher operating costs than surface mines. When metal prices decrease, profitability is jeopardized due to the high costs. Therefore, mining management harnesses new practices that increase operational efficiency. One way to manage this challenge is to invest in new mine planning practices. Stope layout optimization as a part of underground mine planning aims to identify a portion of the orebody in the form of production volumes (stopes) to maximize profit under roadway and stope dimension constraints. In this paper we propose a novel approach based on identifying ore-rich areas of the deposit and prioritizing their extraction through an iterative heuristic clustering approach. The proposed approach is compared with and validated by an exact method through a small mining example. The heuristics produced nearly identical results in a very short time. Finally, a case study was carried out using a larger data-set. The cluster-based iterative approach generated near-optimal stope layouts in a computationally effective manner

Palabras clave : underground mining; iterative optimization; stope layout planning; sublevel stoping.

        · texto en Inglés     · Inglés ( pdf )

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons