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

A novel optimization model for the dig-limit definition problem in open pit mines with multiple destinations

Author

Listed:
  • Nelis, Gonzalo
  • Morales, Nelson
  • Estay, Rodrigo
  • Manríquez, Fabián
  • Vivar, Patricio
  • Morales, Constanza

Abstract

Dig-limit optimization is a crucial step in the grade-control process for open-pit mines. During short-term planning, blasthole data is used to generate an updated block model, typically, with a finer spatial resolution than the loading equipment's selectivity. Consequently, short-term planners must define operational dig-limits, determining the destination of each Selective Mining Unit (SMU) while accounting for the shovel bucket's size. This task is labor-intensive, highly time-consuming, and prone to SMU misclassification, potentially reducing profit and target fulfillment in the operation. To address these challenges, we propose a novel optimization model for defining optimal dig-limits for open pit mining. The model extends the state-of-the-art by including a wide range of destinations with capacity and blending constraints, and differential selectivity by equipment. Three case studies demonstrate the application of the model in short- and medium-term planning setups. Results indicate an average profit improvement of 7.3% compared to manually drawn dig-limits. Additionally, capacity and blending constraints significantly influence the optimal SMU assignment in scenarios with multiple destinations. The proposed model is computationally more efficient than existing exact methods, solving larger benches and complex setups to optimality using an off-the-shelf solver. This enhanced efficiency and versatility make the model a valuable tool for improving grade-control workflows in open-pit mining operations.

Suggested Citation

  • Nelis, Gonzalo & Morales, Nelson & Estay, Rodrigo & Manríquez, Fabián & Vivar, Patricio & Morales, Constanza, 2025. "A novel optimization model for the dig-limit definition problem in open pit mines with multiple destinations," Resources Policy, Elsevier, vol. 102(C).
  • Handle: RePEc:eee:jrpoli:v:102:y:2025:i:c:s0301420725000522
    DOI: 10.1016/j.resourpol.2025.105510
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0301420725000522
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.resourpol.2025.105510?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.

    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:102:y:2025:i:c:s0301420725000522. 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.