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

A simulated annealing based approach for open pit mine production scheduling with stockpiling option

Author

Listed:
  • Danish, Abid Ali Khan
  • Khan, Asif
  • Muhammad, Khan
  • Ahmad, Waqas
  • Salman, Saad

Abstract

Production scheduling plays a pivotal role in successfully executing any open-pit mining operation. It defines the most profitable extraction sequence of mineralized material from the ground subject to various physical and operational constraints. Different mathematical formulations have been proposed to achieve this goal; however, solving these models for real-sized deposits with multiple constraints is a challenging and computationally expensive task. Moreover, the inclusion of stockpiling option further complicates this task. The stockpile option adds flexibility to the operation by allowing excess low-grade ore storage for processing at a later stage when processing capacity is available. Accurate integration of stockpiling option in the production scheduling process through mathematical approaches leads to nonlinear constraints. This could further complicate the already challenging task since linear approximation of these nonlinear constraints could lead to sub-optimal results. Metaheuristic techniques could play an essential role in handling such situations. Though several attempts have been made to solve this problem through these techniques, little effort has been made to incorporate stockpiling option in the optimization process. This article presents a Simulated Annealing based approach for production scheduling of open-pit mines with stockpiling option. The proposed approach uses a stockpile and a greedy heuristic with a Simulated Annealing algorithm to achieve this goal. The greedy heuristic improves the Simulated Annealing algorithm's computational efficiency by managing its randomness. The proposed approach's performance and efficiency are demonstrated through three case studies (A, B, and C) under different algorithmic settings. Results of these case studies reveals that compared with the CPLEX solver, the proposed approach produced near optimal solution, within reasonable amount of time, proving the applicability of the proposed approach.

Suggested Citation

  • Danish, Abid Ali Khan & Khan, Asif & Muhammad, Khan & Ahmad, Waqas & Salman, Saad, 2021. "A simulated annealing based approach for open pit mine production scheduling with stockpiling option," Resources Policy, Elsevier, vol. 71(C).
    • Handle: RePEc:eee:jrpoli:v:71:y:2021:i:c:s0301420721000337
    DOI: 10.1016/j.resourpol.2021.102016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0301420721000337
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.resourpol.2021.102016?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.

    References listed on IDEAS

    as
    1. W. Lambert & A. Newman, 2014. "Tailored Lagrangian Relaxation for the open pit block sequencing problem," Annals of Operations Research, Springer, vol. 222(1), pages 419-438, November.
    2. Lamghari, Amina & Dimitrakopoulos, Roussos, 2012. "A diversified Tabu search approach for the open-pit mine production scheduling problem with metal uncertainty," European Journal of Operational Research, Elsevier, vol. 222(3), pages 642-652.
    3. Daniel Espinoza & Marcos Goycoolea & Eduardo Moreno & Alexandra Newman, 2013. "MineLib: a library of open pit mining problems," Annals of Operations Research, Springer, vol. 206(1), pages 93-114, July.
    4. Renaud Chicoisne & Daniel Espinoza & Marcos Goycoolea & Eduardo Moreno & Enrique Rubio, 2012. "A New Algorithm for the Open-Pit Mine Production Scheduling Problem," Operations Research, INFORMS, vol. 60(3), pages 517-528, June.
    5. M Kumral & P A Dowd, 2005. "A simulated annealing approach to mine production scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 922-930, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Lu Chen & Qinghua Gu & Rui Wang & Zhidong Feng & Chao Zhang, 2022. "Comprehensive Utilization of Mineral Resources: Optimal Blending of Polymetallic Ore Using an Improved NSGA-III Algorithm," Sustainability, MDPI, vol. 14(17), pages 1-19, August.
    2. Lin, Jingsi & Asad, Mohammad Waqar Ali & Topal, Erkan & Chang, Ping & Huang, Jinxin & Lin, Wei, 2024. "A novel model for sustainable production scheduling of an open-pit mining complex considering waste encapsulation," Resources Policy, Elsevier, vol. 91(C).
    3. 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).
    4. Noriega, Roberto & Pourrahimian, Yashar, 2022. "A systematic review of artificial intelligence and data-driven approaches in strategic open-pit mine planning," Resources Policy, Elsevier, vol. 77(C).
    5. Biswas, Pritam & Sinha, Rabindra Kumar & Sen, Phalguni, 2023. "A review of state-of-the-art techniques for the determination of the optimum cut-off grade of a metalliferous deposit with a bibliometric mapping in a surface mine planning context," Resources Policy, Elsevier, vol. 83(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Samavati, Mehran & Essam, Daryl & Nehring, Micah & Sarker, Ruhul, 2017. "A methodology for the large-scale multi-period precedence-constrained knapsack problem: an application in the mining industry," International Journal of Production Economics, Elsevier, vol. 193(C), pages 12-20.
    2. Amina Lamghari & Roussos Dimitrakopoulos & Jacques Ferland, 2015. "A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines," Journal of Global Optimization, Springer, vol. 63(3), pages 555-582, November.
    3. Nancel-Penard, Pierre & Morales, Nelson & Cornillier, Fabien, 2022. "A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: An application to the open-pit mine block sequencing problem," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1088-1099.
    4. Jélvez, Enrique & Morales, Nelson & Nancel-Penard, Pierre & Peypouquet, Juan & Reyes, Patricio, 2016. "Aggregation heuristic for the open-pit block scheduling problem," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1169-1177.
    5. Jélvez, Enrique & Morales, Nelson & Nancel-Penard, Pierre & Cornillier, Fabien, 2020. "A new hybrid heuristic algorithm for the Precedence Constrained Production Scheduling Problem: A mining application," Omega, Elsevier, vol. 94(C).
    6. Gonzalo Muñoz & Daniel Espinoza & Marcos Goycoolea & Eduardo Moreno & Maurice Queyranne & Orlando Rivera Letelier, 2018. "A study of the Bienstock–Zuckerberg algorithm: applications in mining and resource constrained project scheduling," Computational Optimization and Applications, Springer, vol. 69(2), pages 501-534, March.
    7. Samavati, Mehran & Essam, Daryl & Nehring, Micah & Sarker, Ruhul, 2018. "A new methodology for the open-pit mine production scheduling problem," Omega, Elsevier, vol. 81(C), pages 169-182.
    8. Shishvan, Masoud Soleymani & Sattarvand, Javad, 2015. "Long term production planning of open pit mines by ant colony optimization," European Journal of Operational Research, Elsevier, vol. 240(3), pages 825-836.
    9. Zeng, Lanyan & Liu, Shi Qiang & Kozan, Erhan & Corry, Paul & Masoud, Mahmoud, 2021. "A comprehensive interdisciplinary review of mine supply chain management," Resources Policy, Elsevier, vol. 74(C).
    10. Samavati, Mehran & Essam, Daryl & Nehring, Micah & Sarker, Ruhul, 2017. "A local branching heuristic for the open pit mine production scheduling problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 261-271.
    11. Benjamin Johnson & Alexandra Newman & Jeffrey King, 2017. "Optimizing high-level nuclear waste disposal within a deep geologic repository," Annals of Operations Research, Springer, vol. 253(2), pages 733-755, June.
    12. Tabesh, Mohammad & Moradi Afrapoli, Ali & Askari-Nasab, Hooman, 2023. "A two-stage simultaneous optimization of NPV and throughput in production planning of open pit mines," Resources Policy, Elsevier, vol. 80(C).
    13. Noriega, Roberto & Pourrahimian, Yashar, 2022. "A systematic review of artificial intelligence and data-driven approaches in strategic open-pit mine planning," Resources Policy, Elsevier, vol. 77(C).
    14. Amin Mousavi & Erhan Kozan & Shi Qiang Liu, 2016. "Comparative analysis of three metaheuristics for short-term open pit block sequencing," Journal of Heuristics, Springer, vol. 22(3), pages 301-329, June.
    15. Thomas W. M. Vossen & R. Kevin Wood & Alexandra M. Newman, 2016. "Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing," Operations Research, INFORMS, vol. 64(4), pages 771-793, August.
    16. Mai, Ngoc Luan & Topal, Erkan & Erten, Oktay & Sommerville, Bruce, 2019. "A new risk-based optimisation method for the iron ore production scheduling using stochastic integer programming," Resources Policy, Elsevier, vol. 62(C), pages 571-579.
    17. Alipour, Aref & Khodaiari, Ali Asghar & Jafari, Ahmad & Tavakkoli-Moghaddam, Reza, 2022. "An integrated approach to open-pit mines production scheduling," Resources Policy, Elsevier, vol. 75(C).
    18. Moreno, Eduardo & Rezakhah, Mojtaba & Newman, Alexandra & Ferreira, Felipe, 2017. "Linear models for stockpiling in open-pit mine production scheduling problems," European Journal of Operational Research, Elsevier, vol. 260(1), pages 212-221.
    19. Devendra Joshi & Marwan Ali Albahar & Premkumar Chithaluru & Aman Singh & Arvind Yadav & Yini Miro, 2022. "A Novel Approach to Integrating Uncertainty into a Push Re-Label Network Flow Algorithm for Pit Optimization," Mathematics, MDPI, vol. 10(24), pages 1-20, December.
    20. Cinna Seifi & Marco Schulze & Jürgen Zimmermann, 2021. "Solution procedures for block selection and sequencing in flat-bedded potash underground mines," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 409-440, June.

    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:71:y:2021:i:c:s0301420721000337. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.