IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i2p171-182.html
   My bibliography  Save this article

Dig-limits optimization through mixed-integer linear programming in open-pit mines

Author

Listed:
  • Yuksel Asli Sari
  • Mustafa Kumral

Abstract

As a type of general layout problems, dig‐limits optimization focuses on generating the ore‐waste boundaries of a bench sector in an open‐pit mining operation. Typically, blast holes are dense; therefore, selective mining units (SMUs) are small, which is not compatible with loading equipment. Loader cannot select ore‐waste boundaries of SMUs because the arm of the excavator is generally longer than SMU sizes. Therefore, clusters of SMUs being compatible with loader movements need to be formed. In this paper, the dig‐limits optimization problem is shown to be NP‐hard and formulated to maximize profit to be obtained from a mining sector such that ore and waste clusters corresponding to mine excavator movements are considered and solved by mixed‐integer linear programming. To see the efficiency of the proposed approach, a case study is conducted on seven sectors of a bench in a gold mine. The results showed that the approach is practical and has potential to increase the value of operation. The resulting average economic value of seven sectors is $129,060. Additionally, optimal design of one bench solved by the model is compared to a manual design of a mining engineer and a deviation of 6.4% has been observed.

Suggested Citation

  • Yuksel Asli Sari & Mustafa Kumral, 2018. "Dig-limits optimization through mixed-integer linear programming in open-pit mines," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(2), pages 171-182, February.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:2:p:171-182
    DOI: 10.1057/s41274-017-0201-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/s41274-017-0201-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/s41274-017-0201-z?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. Nelis, Gonzalo & Morales, Nelson & Jelvez, Enrique, 2023. "Optimal mining cut definition and short-term open pit production scheduling under geological uncertainty," Resources Policy, Elsevier, vol. 81(C).

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:69:y:2018:i:2:p:171-182. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.