IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-00771483.html
   My bibliography  Save this paper

New approach to flexible open pit optimisation and scheduling

Author

Listed:
  • Margaret Armstrong

    (CERNA i3 - Centre d'économie industrielle i3 - Mines Paris - PSL (École nationale supérieure des mines de Paris) - PSL - Université Paris Sciences et Lettres - I3 - Institut interdisciplinaire de l’innovation - CNRS - Centre National de la Recherche Scientifique)

  • Alain Galli

    (CERNA i3 - Centre d'économie industrielle i3 - Mines Paris - PSL (École nationale supérieure des mines de Paris) - PSL - Université Paris Sciences et Lettres - I3 - Institut interdisciplinaire de l’innovation - CNRS - Centre National de la Recherche Scientifique)

Abstract

This paper proposes a dynamic procedure for pit optimisation as the resources become better known and as commodity prices and costs evolve over time. Mining sequences are defined as the quantities to be extracted from each macroblock (rather than small blocks) in each time period. Feasible mining sequences are mining sequences that respect the accessibility constraints, and also the geometric constraints on the amounts that can be extracted from any one block over time, or from all the active blocks at a given time. Having defined feasible mining sequences, their mathematical properties (closure and convexity under certain operations) were studied. Feasible mining sequences are generated randomly. Then a two-step procedure is used to find the best one (or the best few) using three economic criteria. The procedure was tested on a synthetic gold mine based on the characteristics of the Essakane mine in Burkina Faso. The results were encouraging.

Suggested Citation

  • Margaret Armstrong & Alain Galli, 2012. "New approach to flexible open pit optimisation and scheduling," Post-Print hal-00771483, HAL.
    • Handle: RePEc:hal:journl:hal-00771483
    DOI: 10.1179/1743286312Y.0000000008
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Yasrebi, Amir Bijan & Hezarkhani, Ardeshir & Afzal, Peyman, 2017. "Application of Present Value-Volume (PV-V) and NPV-Cumulative Total Ore (NPV-CTO) fractal modelling for mining strategy selection," Resources Policy, Elsevier, vol. 53(C), pages 384-393.

    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:hal:journl:hal-00771483. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.