IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0333606.html
   My bibliography  Save this article

A new simulated annealing algorithm for simultaneous open-pit and waste dump scheduling in mining complexes

Author

Listed:
  • Jingsi Lin
  • Mohammad Waqar Ali Asad
  • Erkan Topal
  • Ping Chang

Abstract

Production scheduling models for open-pit mining complexes determine the optimal sequence for extracting mining blocks while adhering to technical and operational constraints. Although various mathematical models are available in the literature, solving them for large-scale operations remains computationally intensive. This challenge becomes more complex when models aim to simultaneously schedule block extraction and waste dumping, as this introduces additional variables and constraints, further complicating the problem. This paper presents a novel Simulated Annealing (SA)-based algorithm as a solution method for the simultaneous optimisation of block extraction and waste dumping sequences in open-pit mining complexes. The proposed approach incorporates an innovative variable reduction technique and a heuristic for generating reliable initial solutions. Numerical results show that the proposed algorithm achieves an NPV within 6.08% of the exact solution derived through a commercial solver while reducing the runtime by 82%. More importantly, for relatively larger instances that commercial solver fails to resolve, the proposed method maintains robust performance and delivers high-quality solutions within reasonable computational times.

Suggested Citation

  • Jingsi Lin & Mohammad Waqar Ali Asad & Erkan Topal & Ping Chang, 2025. "A new simulated annealing algorithm for simultaneous open-pit and waste dump scheduling in mining complexes," PLOS ONE, Public Library of Science, vol. 20(10), pages 1-27, October.
  • Handle: RePEc:plo:pone00:0333606
    DOI: 10.1371/journal.pone.0333606
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0333606
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0333606&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0333606?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
    ---><---

    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:plo:pone00:0333606. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.