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

Combined optimisation of an open-pit mine outline and the transition depth to underground mining

Author

Listed:
  • Whittle, D.
  • Brazil, M.
  • Grossman, P.A.
  • Rubinstein, J.H.
  • Thomas, D.A.

Abstract

Miners harvest minerals from ore-bodies in the ground by a variety of specialised mining methods, with most falling into the categories of open-pit and underground. Some ore-bodies are harvested by a combination of open-pit and underground methods. In these cases there is often material that could be mined by either method, and an economic choice has to be made. This is referred to as the transition problem and it has received some attention in the mining literature since the 1980s and more recently has had attention in the mathematics literature. The transition problem is complicated by the need in many cases to leave a crown pillar (un-mined rock above the underground mine) and for this crown pillar to have a prescribed shape.

Suggested Citation

  • Whittle, D. & Brazil, M. & Grossman, P.A. & Rubinstein, J.H. & Thomas, D.A., 2018. "Combined optimisation of an open-pit mine outline and the transition depth to underground mining," European Journal of Operational Research, Elsevier, vol. 268(2), pages 624-634.
    • Handle: RePEc:eee:ejores:v:268:y:2018:i:2:p:624-634
    DOI: 10.1016/j.ejor.2018.02.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718301000
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.02.005?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. Alexandra Newman & Candace Yano & Enrique Rubio, 2013. "Mining above and below ground: timing the transition," IISE Transactions, Taylor & Francis Journals, vol. 45(8), pages 865-882.
    2. Jean-Claude Picard, 1976. "Maximal Closure of a Graph and Applications to Combinatorial Problems," Management Science, INFORMS, vol. 22(11), pages 1268-1272, July.
    3. Dorit S. Hochbaum, 2008. "The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem," Operations Research, INFORMS, vol. 56(4), pages 992-1009, 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. 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. 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.
    3. 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).

    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. 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. Madziwa, Lawrence & Pillalamarry, Mallikarjun & Chatterjee, Snehamoy, 2023. "Integrating stochastic mine planning model with ARDL commodity price forecasting," Resources Policy, Elsevier, vol. 85(PB).
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Lamas, Patricio & Goycoolea, Marcos & Pagnoncelli, Bernardo & Newman, Alexandra, 2024. "A target-time-windows technique for project scheduling under uncertainty," European Journal of Operational Research, Elsevier, vol. 314(2), pages 792-806.
    9. Armin Fügenschuh & Marzena Fügenschuh, 2008. "Integer linear programming models for topology optimization in sheet metal design," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 313-331, October.
    10. 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).
    11. 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.
    12. Domenico Moramarco & Umutcan Salman, 2023. "Equal opportunities in many-to-one matching markets," Working Papers 649, ECINEQ, Society for the Study of Economic Inequality.
    13. Dorit S. Hochbaum, 2003. "Efficient Algorithms for the Inverse Spanning-Tree Problem," Operations Research, INFORMS, vol. 51(5), pages 785-797, October.
    14. Esmaeili, Ahmadreza & Hamidi, Jafar Khademi & Mousavi, Amin, 2023. "Determination of sublevel stoping layout using a network flow algorithm and the MRMR classification system," Resources Policy, Elsevier, vol. 80(C).
    15. 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.
    16. Lorenzo Reus & Mathias Belbèze & Hans Feddersen & Enrique Rubio, 2018. "Extraction Planning Under Capacity Uncertainty at the Chuquicamata Underground Mine," Interfaces, INFORMS, vol. 48(6), pages 543-555, November.
    17. 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.
    18. Roberto Asín Achá & Dorit S. Hochbaum & Quico Spaen, 2020. "HNCcorr: combinatorial optimization for neuron identification," Annals of Operations Research, Springer, vol. 289(1), pages 5-32, June.
    19. 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.
    20. Joseph G. Szmerekovsky & George L. Vairaktarakis, 2006. "Maximizing project cash availability," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 272-284, 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:ejores:v:268:y:2018:i:2:p:624-634. 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.