Deep Learning Decision Support System for Open-Pit Mining Optimisation: GPU-Accelerated Planning Under Geological Uncertainty
- URL: http://arxiv.org/abs/2511.18296v1
- Date: Sun, 23 Nov 2025 05:27:04 GMT
- Title: Deep Learning Decision Support System for Open-Pit Mining Optimisation: GPU-Accelerated Planning Under Geological Uncertainty
- Abstract summary: This study introduces a fully uncertainty-aware optimization framework for long-term open-pit mine planning.<n> Geological uncertainty is modelled using a Variational Autoencoder trained on 50,000 spatial grade samples.<n>Results demonstrate up to 1.2 million-fold improvement over IBM CPLEX and significantly higher expected NPV under geological uncertainty.
- Score: 0.7310043452300737
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This study presents Part II of an AI-enhanced Decision Support System (DSS), extending Rahimi (2025, Part I) by introducing a fully uncertainty-aware optimization framework for long-term open-pit mine planning. Geological uncertainty is modelled using a Variational Autoencoder (VAE) trained on 50,000 spatial grade samples, enabling the generation of probabilistic, multi-scenario orebody realizations that preserve geological continuity and spatial correlation. These scenarios are optimized through a hybrid metaheuristic engine integrating Genetic Algorithms (GA), Large Neighborhood Search (LNS), Simulated Annealing (SA), and reinforcement-learning-based adaptive control. An ε-constraint relaxation strategy governs the population exploration phase, allowing near-feasible schedule discovery early in the search and gradual tightening toward strict constraint satisfaction. GPU-parallel evaluation enables the simultaneous assessment of 65,536 geological scenarios, achieving near-real-time feasibility analysis. Results demonstrate up to 1.2 million-fold runtime improvement over IBM CPLEX and significantly higher expected NPV under geological uncertainty, confirming the DSS as a scalable and uncertainty-resilient platform for intelligent mine planning.
Related papers
- Think2Go: Generative Next POI Recommendation with LLM Reasoning [57.37706163990998]
Next Point-of-Interest (POI) recommendation task focuses on mining user behavioral preference patterns from historical check-ins to provide personalized suggestions for the next destination.<n>Existing methods rely on shallow contextual information and handcrafted feature interactions to predict the next POI.<n>We propose Think2Go, a novel generative next POI recommendation framework, which enhances the model's comprehension of SID representations and explores diverse spatial-temporal patterns via test-time computational scaling.
arXiv Detail & Related papers (2026-07-31T03:52:20Z) - Aligning Data-Driven Predictors with Allocation: A Decision-Focused Approach to Survival Analysis [52.10284705210197]
We show that machine learning predictors can yield arbitrarily poor outcomes when used for allocation.<n>We introduce a decision-focused learning approach based on optimizing normalized discounted cumulative gain (NDCG)<n>We propose a bootstrapping approach to optimize the NDCG of existing survival models.
arXiv Detail & Related papers (2026-06-01T12:03:22Z) - Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
arXiv Detail & Related papers (2026-05-27T14:02:20Z) - Adaptive mine planning under geological uncertainty: A POMDP framework for sequential decision-making [0.13048920509133807]
We formulate mine scheduling as a Partially Observable Markov Decision Process (POMDP)<n>We introduce a hybrid SA-POMDP architecture that combines simulated annealing-based (SA) value approximation with ensemble-based belief updating.<n>We evaluate the framework on a copper-gold open-pit mining complex with multiple processing destinations.
arXiv Detail & Related papers (2026-05-13T15:52:29Z) - Efficient Policy Learning with Hybrid Evaluation-Based Genetic Programming for Uncertain Agile Earth Observation Satellite Scheduling [12.409081996599665]
The Agile Earth Observation Satellite Scheduling Problem (UAEOSSP) is a novel optimization problem.<n>It incorporates uncertainties in profit, resource consumption, and visibility, which may render pre-planned schedules suboptimal or even infeasible.<n>This paper proposes a Hybrid Evaluation-based Genetic Programming (HE-GP) for effectively solving UAEOSSP.
arXiv Detail & Related papers (2026-03-09T14:43:36Z) - GTS: Inference-Time Scaling of Latent Reasoning with a Learnable Gaussian Thought Sampler [54.10960908347221]
We model latent thought exploration as conditional sampling from learnable densities and instantiate this idea as a Gaussian Thought Sampler (GTS)<n>GTS predicts context-dependent perturbation distributions over continuous reasoning states and is trained with GRPO-style policy optimization while keeping the backbone frozen.
arXiv Detail & Related papers (2026-02-15T09:57:47Z) - Bridging the Gap Between Bayesian Deep Learning and Ensemble Weather Forecasts [100.26854618129039]
Weather forecasting is fundamentally challenged by the chaotic nature of the atmosphere.<n>Recent advances in Bayesian Deep Learning (BDL) offer a promising but often disconnected alternative.<n>We bridge these paradigms through a unified hybrid BDL framework for ensemble weather forecasting.
arXiv Detail & Related papers (2025-11-18T07:49:52Z) - Bi-Objective Evolutionary Optimization for Large-Scale Open Pit Mine Scheduling Problem under Uncertainty with Chance Constraints [3.6439154309310013]
This paper presents a bi-objective formulation of the open-pit mine scheduling problem (OPMSP)<n>It simultaneously maximizes expected net present value and minimizes scheduling risk, independent of the confidence level required for the constraint.<n>Results demonstrate that the proposed bi-objective formulation yields more robust and balanced trade-offs between economic value and risk compared to single-objective, confidence-dependent approach.
arXiv Detail & Related papers (2025-11-11T14:05:29Z) - OTSurv: A Novel Multiple Instance Learning Framework for Survival Prediction with Heterogeneity-aware Optimal Transport [58.5751036808652]
Survival prediction using whole slide images (WSIs) can be formulated as a multiple instance learning (MIL) problem.<n>We propose OTSurv, a novel MIL framework from an optimal transport perspective.<n>We set new results across six popular benchmarks, achieving an absolute 3.6% improvement in average C-index.
arXiv Detail & Related papers (2025-06-25T18:09:42Z) - Model-Free Kernel Conformal Depth Measures Algorithm for Uncertainty Quantification in Regression Models in Separable Hilbert Spaces [9.504740492278003]
We propose a model-free uncertainty quantification algorithm based on conditional depth measures and an integrated depth measure.<n>New algorithms can be used to define prediction and tolerance regions when predictors and responses are defined in separable Hilbert spaces.<n>We demonstrate the practical relevance of our approach through a digital health application related to physical activity.
arXiv Detail & Related papers (2025-06-10T01:25:37Z) - Efficient Transformed Gaussian Process State-Space Models for Non-Stationary High-Dimensional Dynamical Systems [49.819436680336786]
We propose an efficient transformed Gaussian process state-space model (ETGPSSM) for scalable and flexible modeling of high-dimensional, non-stationary dynamical systems.<n>Specifically, our ETGPSSM integrates a single shared GP with input-dependent normalizing flows, yielding an expressive implicit process prior that captures complex, non-stationary transition dynamics.<n>Our ETGPSSM outperforms existing GPSSMs and neural network-based SSMs in terms of computational efficiency and accuracy.
arXiv Detail & Related papers (2025-03-24T03:19:45Z) - An Optimal Cascade Feature-Level Spatiotemporal Fusion Strategy for Anomaly Detection in CAN Bus [2.8151714475955263]
Intelligent transportation systems (ITS) play a pivotal role in modern infrastructure but face security risks due to the broadcast-based nature of the in-vehicle Controller Area Network (CAN) buses.<n>The proposed framework detects all attack types with 100% accuracy, outperforming state-of-the-art methods.
arXiv Detail & Related papers (2025-01-31T00:36:08Z) - Efficiently Training Deep-Learning Parametric Policies using Lagrangian Duality [55.06411438416805]
Constrained Markov Decision Processes (CMDPs) are critical in many high-stakes applications.<n>This paper introduces a novel approach, Two-Stage Deep Decision Rules (TS- DDR) to efficiently train parametric actor policies.<n>It is shown to enhance solution quality and to reduce computation times by several orders of magnitude when compared to current state-of-the-art methods.
arXiv Detail & Related papers (2024-05-23T18:19:47Z) - Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs [60.40452803295326]
We propose a new reward-free algorithm for learning linear Markov decision processes (MDPs)
At the core of our algorithm is uncertainty-weighted value-targeted regression with exploration-driven pseudo-reward.
We show that our algorithm only needs to explore $tilde O( d2varepsilon-2)$ episodes to find an $varepsilon$-optimal policy.
arXiv Detail & Related papers (2023-03-17T17:53:28Z) - Deep learning for prediction of complex geology ahead of drilling [0.0]
Decision support systems can help cope with high volumes of data and interpretation complexities.
They can assimilate the real-time measurements into a probabilistic earth model and use the updated model for decision recommendations.
In this paper, we introduce two ML techniques into the geosteering decision support framework.
arXiv Detail & Related papers (2021-04-06T14:42:33Z) - Temporal-Structure-Assisted Gradient Aggregation for Over-the-Air
Federated Edge Learning [24.248673415586413]
We introduce a Markovian probability model to characterize the intrinsic temporal structure of the model aggregation series.
We develop a message passing algorithm, termed temporal-structure-assisted gradient aggregation (TSA-GA), to fulfil this estimation task.
We show that the proposed TSAGA algorithm significantly outperforms the state-of-the-art, and is able to achieve comparable learning performance.
arXiv Detail & Related papers (2021-03-03T09:13:27Z) - Combining Deep Learning and Optimization for Security-Constrained
Optimal Power Flow [94.24763814458686]
Security-constrained optimal power flow (SCOPF) is fundamental in power systems.
Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs.
This paper proposes a novel approach that combines deep learning and robust optimization techniques.
arXiv Detail & Related papers (2020-07-14T12:38:21Z) - A Dynamical Systems Approach for Convergence of the Bayesian EM
Algorithm [59.99439951055238]
We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based.
The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM)
We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
arXiv Detail & Related papers (2020-06-23T01:34:18Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.