A stochastic mixed integer linear programming framework for oil sands mine planning and waste management in the presence of grade uncertainty
Bibliographic record
Abstract
The primary purpose of oil sands mine planning and waste management is to provide ore from the mine pit to the processing plant while containing the tailings in an efficient manner in-pit. Incorporating waste management in the mine plan is essential to maximize the economic potential of the mineral reserve and minimize waste management costs. However, spatial variability such as grade uncertainty results in ore tonnage variations, which leads to fluctuations in the quantity of ore to be processed and waste to be managed. This paper investigates the application of a stochastic mixed integer linear programming (SMILP) on oil sands mine planning to integrate bitumen grade uncertainty and waste management. Sequential Gaussian simulation is employed to quantitatively model the spatial variability of bitumen grade in the oil sands deposit. Multiple simulated orebody models are used as inputs for the SMILP model to generate optimal mine plans in the presence of grade uncertainty. The results demonstrate that the SMILP schedule generates 14% and 17% improvements in net present value compared to the E-type and ordinary kriging schedules, respectively. These results indicate that the SMILP model is a robust tool for optimizing stochastic integrated oil sands production schedules and waste management.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".