IDEAS home Printed from https://ideas.repec.org/a/eee/jrpoli/v62y2019icp515-526.html
   My bibliography  Save this article

Stope boundary optimization: A mathematical model and efficient heuristics

Author

Listed:
  • Nikbin, V.
  • Ataee-pour, M.
  • Shahriar, K.
  • Pourrahimian, Y.
  • MirHassani, S.A.

Abstract

Solving the stope boundary optimization problem is the primary step that should be taken after selecting an underground mining method. Obviously, this solution should be optimal because suboptimal boundaries may lead to wasting both mining capital and mineral resources. Four decades have passed since the first algorithm was developed to solve this problem, and no comprehensive method has yet been reported. The current study presents an integer programming (IP) model to solve the stope boundary optimization (SBO) problem. The application domain of this model is limited to non-complex problems, and thus, to cover all the stope boundary optimization problems, a greedy algorithm is also developed. The greedy algorithm was implemented on three real cases and its optimality gap on these cases is 1.85%, 0.47%, and 1.42%, respectively. However, to obtain better results and decrease the optimality gap, this paper introduces a new iterative enumeration algorithm. The proposed algorithm uses two inner algorithms: the Improved Greedy and Approximate Dynamic Programming algorithms. The optimality gap of the Iterative Enumeration algorithm in all the mentioned cases was less than 0.6%.

Suggested Citation

  • Nikbin, V. & Ataee-pour, M. & Shahriar, K. & Pourrahimian, Y. & MirHassani, S.A., 2019. "Stope boundary optimization: A mathematical model and efficient heuristics," Resources Policy, Elsevier, vol. 62(C), pages 515-526.
    • Handle: RePEc:eee:jrpoli:v:62:y:2019:i:c:p:515-526
    DOI: 10.1016/j.resourpol.2018.10.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0301420718303519
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.resourpol.2018.10.007?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sotoudeh, Farzad & Nehring, Micah & Kizil, Mehmet & Knights, Peter & Mousavi, Amin, 2020. "Production scheduling optimisation for sublevel stoping mines using mathematical programming: A review of literature and future directions," Resources Policy, Elsevier, vol. 68(C).
    2. Nikbin, V. & Ataee-pour, M. & Anani, A., 2020. "Optimization of level intervals in steeply-dipping vein deposits: A two-step approach," Resources Policy, Elsevier, vol. 69(C).
    3. Morales, Nelson & Mancilla, Diego & Miranda, Roberto & Vallejos, Javier, 2022. "A fast method to develop an optimal operational sublevel stope design," Resources Policy, Elsevier, vol. 77(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jrpoli:v:62:y:2019:i:c:p:515-526. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/30467 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.