IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v249y2016i3p1169-1177.html
   My bibliography  Save this article

Aggregation heuristic for the open-pit block scheduling problem

Author

Listed:
  • Jélvez, Enrique
  • Morales, Nelson
  • Nancel-Penard, Pierre
  • Peypouquet, Juan
  • Reyes, Patricio

Abstract

In order to establish a production plan, an open-pit mine is partitioned into a three-dimensional array of blocks. The order in which blocks are extracted and processed has a dramatic impact on the economic value of the exploitation. Since realistic models have millions of blocks and constraints, the combinatorial optimization problem of finding the extraction sequence that maximizes the profit is computationally intractable. In this work, we present a procedure, based on innovative aggregation and disaggregation heuristics, that allows us to get feasible and nearly optimal solutions. The method was tested on the public reference library MineLib and improved the best known results in the literature in 9 of the 11 instances of the library. Moreover, the overall procedure is very scalable, which makes it a promising tool for large size problems.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:249:y:2016:i:3:p:1169-1177
    DOI: 10.1016/j.ejor.2015.10.044
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715009704
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.10.044?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. 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.
    2. 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.
    3. Felipe Alvarez & Jorge Amaya & Andreas Griewank & Nikolai Strogies, 2011. "A continuous framework for open pit mine planning," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(1), pages 29-54, February.
    4. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    5. 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.
    6. Dorit S. Hochbaum & Anna Chen, 2000. "Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem," Operations Research, INFORMS, vol. 48(6), pages 894-914, December.
    7. 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.
    8. Jean-Claude Picard, 1976. "Maximal Closure of a Graph and Applications to Combinatorial Problems," Management Science, INFORMS, vol. 22(11), pages 1268-1272, July.
    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. Changyou Xu & Gang Chen & Huabo Lu & Qiuxia Zhang & Zhengke Liu & Jing Bian, 2024. "Integrated Optimization of Production Scheduling and Haulage Route Planning in Open-Pit Mines," Mathematics, MDPI, vol. 12(13), pages 1-24, July.
    2. 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).
    3. Hooshmand, F. & Mirarabrazi, F. & MirHassani, S.A., 2020. "Efficient Benders decomposition for distance-based critical node detection problem," Omega, Elsevier, vol. 93(C).
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    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. 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.
    11. 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).
    12. 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.
    13. 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.
    14. 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.

    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. 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.
    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. 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).
    4. 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.
    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. 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.
    7. Paithankar, Amol & Chatterjee, Snehamoy & Goodfellow, Ryan, 2021. "Open-pit mining complex optimization under uncertainty with integrated cut-off grade based destination policies," Resources Policy, Elsevier, vol. 70(C).
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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).
    13. 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.
    14. 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).
    15. 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).
    16. 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.
    17. 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).
    18. 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.
    19. 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.
    20. 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.

    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:ejores:v:249:y:2016:i:3:p:1169-1177. 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/eor .

    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.