SciELO - Scientific Electronic Library Online

 
vol.116 número12 í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

COPLAND, T.  y  NEHRING, M.. Integrated optimization of stope boundary selection and scheduling for sublevel stoping operations. J. S. Afr. Inst. Min. Metall. [online]. 2016, vol.116, n.12, pp.1135-1142. ISSN 2411-9717.  http://dx.doi.org/10.17159/2411-9717/2016/v116n12a7.

The decreasing availability of resources amenable to surface operations has led to increasing numbers of underground mines, with trends indicating this will continue into the future. As a result, there is a need for additional optimization processes and techniques for underground mines, with many analogous methods having already been developed for surface mining. Current methods for design and optimization of stope boundary selection and scheduling mainly involve heuristic methods which focus on a single lever. Individual optimality may be approached, but globally optimal results can be obtained only by an integrated, rigorous approach. In this paper we review previous methodologies for stope boundary selection and medium- to long-term scheduling and highlight the need for an integrated approach. Previous integrated approaches are reviewed and an improved modelling system proposed for shorter solution times and greater applicability to mining situations. Randomly generated data-sets for gold-copper mineralization are used to investigate the model performance, describing solution time as a function of data complexity.

Palabras clave : integer programming; operations research; sublevel stoping; stope boundary selection and scheduling; underground mining.

        · 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