Adaptive Strategies for The Open-Pit Mine Optimal Scheduling Problem - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

Adaptive Strategies for The Open-Pit Mine Optimal Scheduling Problem

Résumé

Within the mining discipline, mine planning is the component that studies how to transform the information about the ore resources into value for the owner. For open-pit mines, an optimal block scheduling maximizes the discounted value of the extracted blocks (period by period), called the net present value (NPV). However, to be feasible, a mine schedule must respect the slope constraints. The optimal open-pit block scheduling problem (OPBSP) consists, therefore, in finding such an optimal schedule. On the one hand, we introduce the dynamical optimization approach to mine scheduling in the deterministic case, and we propose a class of (suboptimal) adaptive strategies, the so-called index strategies. We show that they provide upper and lower bounds for the NPV, and we provide numerical results. On the other hand, we introduce a theoretical framework for OPBSP under uncertainty and learning.
Fichier principal
Vignette du fichier
DeLara_Morales_Beeker_COR_2017.pdf (336.53 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01542705 , version 1 (20-06-2017)

Identifiants

Citer

Michel de Lara, Nelson Morales, Nathanaël Beeker. Adaptive Strategies for The Open-Pit Mine Optimal Scheduling Problem. 2017. ⟨hal-01542705⟩
192 Consultations
353 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More