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

Concurrent optimisation of open pit ore and waste movement with optimal haul road selection

Author

Listed:
  • Das, Ranajit
  • Topal, Erkan
  • Mardaneh, Elham

Abstract

Optimal open pit ore and waste scheduling with a network of haulage options create a large combinatorial problem. In this paper, a mathematical model has been proposed to simultaneously optimise pit and waste dump schedules with the shortest haulage selection from possible haul-road networks. The model also determines the optimal quantity of material to be sent through the shortest haulage path for all combinations of sources and destinations. This is a new approach of simultaneous optimisation as earlier studies had optimized pit, dumps and haulage separately missing their combined impact on optimality. The new model has been implemented on several case studies detailed in the paper. A comparison has been performed for a case study which revealed that 39% savings in haulage distances and 44% savings on backfilling to in-pit dumps over a schedule using a mine planning software. Furthermore, different case studies have been solved using an exact as well as a meta-heuristic method developed for the purpose and the results of both methods match within close limits and whereas the meta-heuristics showed a considerable improvement in solution time as data size increased.

Suggested Citation

  • Das, Ranajit & Topal, Erkan & Mardaneh, Elham, 2024. "Concurrent optimisation of open pit ore and waste movement with optimal haul road selection," Resources Policy, Elsevier, vol. 91(C).
    • Handle: RePEc:eee:jrpoli:v:91:y:2024:i:c:s0301420724002010
    DOI: 10.1016/j.resourpol.2024.104834
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0301420724002010
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.resourpol.2024.104834?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:91:y:2024:i:c:s0301420724002010. 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.