Towards sustainable mining: GHG considerate open pit long-term planning using adaptive large neighborhood search algorithm
Bibliographic record
Abstract
Mine planning involves the systematic design and coordination of mineral extraction from the earth’s crust, integrating exploration, production, and various engineering considerations. With increasing emphasis on environmental responsibility, the mining industry is under pressure to incorporate environmental considerations into mine planning. This paper addresses the precedence-constrained production scheduling problem (PCPSP) within the context of green long-term mining planning, aiming to optimize extraction processes while restricting carbon emission. Given the NP-hard nature of the PCPSP, this study introduces an adaptive large neighborhood search (ALNS) algorithm tailored specifically for long-term mine planning. A range of computational experiments have been carried out, including parameter tuning for the ALNS algorithm, comparisons against an exact solver, and analysis of our destroy-repair operators to determine their key elements. The efficacy of developed ALNS, evaluated using various benchmarks, reveals optimality gaps around 0.08. These results highlight the effectiveness of the proposed approach in addressing the PCPSP within mine planning and production scheduling, providing insights into improving mining operations while considering environmental concerns.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".