IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v22y2022i3d10.1007_s12351-020-00618-x.html
   My bibliography  Save this article

Exact algorithms for production planning in mining considering the use of stockpiles and sequencing of power shovels in open-pit mines

Author

Listed:
  • César Flores-Fonseca

    (Universidad del Bío-Bío)

  • Rodrigo Linfati

    (Universidad del Bío-Bío)

  • John Willmer Escobar

    (Universidad del Valle)

Abstract

Chile is the world’s leading producer of copper, with a market share of 26.8% and accounting for approximately 10% of the gross domestic product. Given the importance of this industrial sector in the country, mine planning is a fundamental tool for achieving strategic, tactical and operational goals. This paper proposes methods to solve the problem of scheduling production in mining, considering the storage and sequencing of power shovels in open-pit mines. The first problem is tactical and operational and seeks to determine the extraction period and destination of each block. The second problem is of an operational nature and consists of defining the optimal sequence of block extraction, considering the mining power shovels. To solve both problems, two mixed integer linear programming models have been proposed and tested in real and random structured instances. The objective function of the proposed models is to maximize the net present value (NPV) of scheduling and maximize the work efficiency of the power shovels in the extraction. The proposed models have been implemented in AMPL and have been solved through the IBM CPLEX and Gurobi solvers. The results show the efficiency of the proposed models, demonstrating that including the storage option in the production schedule increases the operational NPV.

Suggested Citation

  • César Flores-Fonseca & Rodrigo Linfati & John Willmer Escobar, 2022. "Exact algorithms for production planning in mining considering the use of stockpiles and sequencing of power shovels in open-pit mines," Operational Research, Springer, vol. 22(3), pages 2529-2553, July.
  • Handle: RePEc:spr:operea:v:22:y:2022:i:3:d:10.1007_s12351-020-00618-x
    DOI: 10.1007/s12351-020-00618-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-020-00618-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s12351-020-00618-x?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. 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.
    2. Rafael Epstein & Marcel Goic & Andrés Weintraub & Jaime Catalán & Pablo Santibáñez & Rodolfo Urrutia & Raúl Cancino & Sergio Gaete & Augusto Aguayo & Felipe Caro, 2012. "Optimizing Long-Term Production Plans in Underground and Open-Pit Copper Mines," Operations Research, INFORMS, vol. 60(1), pages 4-17, February.
    3. Polo, Andrés & Peña, Numar & Muñoz, Dairo & Cañón, Adrián & Escobar, John Willmer, 2019. "Robust design of a closed-loop supply chain under uncertainty conditions integrating financial criteria," Omega, Elsevier, vol. 88(C), pages 110-132.
    4. Jose Bernal & John Willmer Escobar & Juan Camilo Paz & Rodrigo Linfati & Gustavo Gatica, 2018. "A probabilistic granular tabu search for the distance constrained capacitated vehicle routing problem," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 29(4), pages 453-477.
    5. Chatterjee, Snehamoy & Sethi, Manas Ranjan & Asad, Mohammad Waqar Ali, 2016. "Production phase and ultimate pit limit design under commodity price uncertainty," European Journal of Operational Research, Elsevier, vol. 248(2), pages 658-667.
    6. 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.
    7. 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.
    8. Alexandra M. Newman & Enrique Rubio & Rodrigo Caro & Andrés Weintraub & Kelly Eurek, 2010. "A Review of Operations Research in Mine Planning," Interfaces, INFORMS, vol. 40(3), pages 222-245, June.
    Full references (including those not matched with items on IDEAS)

    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. 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).
    2. Zhang, Jian & Nault, Barrie R. & Dimitrakopoulos, Roussos G., 2019. "Optimizing a mineral value chain with market uncertainty using benders decomposition," European Journal of Operational Research, Elsevier, vol. 274(1), pages 227-239.
    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. 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.
    5. Paithankar, Amol & Chatterjee, Snehamoy & Goodfellow, Ryan & Asad, Mohammad Waqar Ali, 2020. "Simultaneous stochastic optimization of production sequence and dynamic cut-off grades in an open pit mining operation," Resources Policy, Elsevier, vol. 66(C).
    6. 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).
    7. Armstrong, Margaret & Lagos, Tomas & Emery, Xavier & Homem-de-Mello, Tito & Lagos, Guido & Sauré, Denis, 2021. "Adaptive open-pit mining planning under geological uncertainty," Resources Policy, Elsevier, vol. 72(C).
    8. Zhang, Jian & Dimitrakopoulos, Roussos G., 2017. "A dynamic-material-value-based decomposition method for optimizing a mineral value chain with uncertainty," European Journal of Operational Research, Elsevier, vol. 258(2), pages 617-625.
    9. 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.
    10. Pérez, Juan & Maldonado, Sebastián & González-Ramírez, Rosa, 2018. "Decision support for fleet allocation and contract renegotiation in contracted open-pit mine blasting operations," International Journal of Production Economics, Elsevier, vol. 204(C), pages 59-69.
    11. 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).
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. Akshay Chowdu & Peter Nesbitt & Andrea Brickey & Alexandra M. Newman, 2022. "Operations Research in Underground Mine Planning: A Review," Interfaces, INFORMS, vol. 52(2), pages 109-132, March.
    17. 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.
    18. 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).
    19. Savolainen, Jyrki, 2016. "Real options in metal mining project valuation: Review of literature," Resources Policy, Elsevier, vol. 50(C), pages 49-65.
    20. Lamghari, Amina & Dimitrakopoulos, Roussos, 2016. "Network-flow based algorithms for scheduling production in multi-processor open-pit mines accounting for metal uncertainty," European Journal of Operational Research, Elsevier, vol. 250(1), pages 273-290.

    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:spr:operea:v:22:y:2022:i:3:d:10.1007_s12351-020-00618-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.