IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v206y2013i1p93-11410.1007-s10479-012-1258-3.html
   My bibliography  Save this article

MineLib: a library of open pit mining problems

Author

Listed:
  • Daniel Espinoza
  • Marcos Goycoolea
  • Eduardo Moreno
  • Alexandra Newman

Abstract

Similar to the mixed-integer programming library (MIPLIB), we present a library of publicly available test problem instances for three classical types of open pit mining problems: the ultimate pit limit problem and two variants of open pit production scheduling problems. The ultimate pit limit problem determines a set of notional three-dimensional blocks containing ore and/or waste material to extract to maximize value subject to geospatial precedence constraints. Open pit production scheduling problems seek to determine when, if ever, a block is extracted from an open pit mine. A typical objective is to maximize the net present value of the extracted ore; constraints include precedence and upper bounds on operational resource usage. Extensions of this problem can include (i) lower bounds on operational resource usage, (ii) the determination of whether a block is sent to a waste dump, i.e., discarded, or to a processing plant, i.e., to a facility that derives salable mineral from the block, (iii) average grade constraints at the processing plant, and (iv) inventories of extracted but unprocessed material. Although open pit mining problems have appeared in academic literature dating back to the 1960s, no standard representations exist, and there are no commonly available corresponding data sets. We describe some representative open pit mining problems, briefly mention related literature, and provide a library consisting of mathematical models and sets of instances, available on the Internet. We conclude with directions for use of this newly established mining library. The library serves not only as a suggestion of standard expressions of and available data for open pit mining problems, but also as encouragement for the development of increasingly sophisticated algorithms. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:206:y:2013:i:1:p:93-114:10.1007/s10479-012-1258-3
    DOI: 10.1007/s10479-012-1258-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-012-1258-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-012-1258-3?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. D. S. Johnson & K. A. Niemi, 1983. "On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees," Mathematics of Operations Research, INFORMS, vol. 8(1), pages 1-14, February.
    3. Gershon, Mark E. & Murphy, Frederic H., 1989. "Optimizing single hole mine cuts by dynamic programming," European Journal of Operational Research, Elsevier, vol. 38(1), pages 56-62, January.
    4. 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.
    5. Ramazan, Salih, 2007. "The new Fundamental Tree Algorithm for production scheduling of open pit mines," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1153-1166, March.
    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. Gerhard Reinelt, 1991. "TSPLIB—A Traveling Salesman Problem Library," INFORMS Journal on Computing, INFORMS, vol. 3(4), pages 376-384, November.
    8. Bala G. Chandran & Dorit S. Hochbaum, 2009. "A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem," Operations Research, INFORMS, vol. 57(2), pages 358-376, April.
    9. Underwood, Robert & Tolwinski, Boleslaw, 1998. "A mathematical programming viewpoint for solving the ultimate pit problem," European Journal of Operational Research, Elsevier, vol. 107(1), pages 96-107, May.
    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. Khaboushan, A.Soltani & Osanloo, M., 2020. "Semi-symmetrical production scheduling of an orebody for optimizing the depth of transitioning from open pit to block caving," Resources Policy, Elsevier, vol. 68(C).
    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. 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.
    4. 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).
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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).
    12. 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.
    13. 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).
    14. 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).
    15. 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.
    16. 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.
    17. Papageorgiou, Dimitri J. & Nemhauser, George L. & Sokol, Joel & Cheon, Myun-Seok & Keha, Ahmet B., 2014. "MIRPLib – A library of maritime inventory routing problem instances: Survey, core model, and benchmark results," European Journal of Operational Research, Elsevier, vol. 235(2), pages 350-366.
    18. Enrique Jelvez & Julian Ortiz & Nelson Morales Varela & Hooman Askari-Nasab & Gonzalo Nelis, 2023. "A Multi-Stage Methodology for Long-Term Open-Pit Mine Production Planning under Ore Grade Uncertainty," Mathematics, MDPI, vol. 11(18), pages 1-19, September.
    19. Leigh Paterson & Jill Miscandlon & David Butler, 2024. "The Juxtaposition of Our Future Electrification Solutions: A View into the Unsustainable Life Cycle of the Permanent Magnet Electrical Machine," Sustainability, MDPI, vol. 16(7), pages 1-26, March.

    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. 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. 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. 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.
    4. 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.
    5. 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.
    6. King, Barry & Goycoolea, Marcos & Newman, A., 2017. "Optimizing the open pit-to-underground mining transition," European Journal of Operational Research, Elsevier, vol. 257(1), pages 297-309.
    7. W. Brian Lambert & Andrea Brickey & Alexandra M. Newman & Kelly Eurek, 2014. "Open-Pit Block-Sequencing Formulations: A Tutorial," Interfaces, INFORMS, vol. 44(2), pages 127-142, April.
    8. 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.
    9. 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.
    10. 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.
    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. O’Sullivan, Dónal & Newman, Alexandra, 2015. "Optimization-based heuristics for underground mine scheduling," European Journal of Operational Research, Elsevier, vol. 241(1), pages 248-259.
    13. 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.
    14. Chung, Joyce & Asad, Mohammad Waqar Ali & Topal, Erkan, 2022. "Timing of transition from open-pit to underground mining: A simultaneous optimisation model for open-pit and underground mine production schedules," Resources Policy, Elsevier, vol. 77(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. 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.
    17. 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.
    18. 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).
    19. 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.
    20. 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).

    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:annopr:v:206:y:2013:i:1:p:93-114:10.1007/s10479-012-1258-3. 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.