mlsanityData to 14 Oct 2026

Bi-objective chance-constrained evolutionary optimization for large-scale open-pit mine scheduling under geological uncertainty

arXiv 2511.08275 ↗First posted 11 Nov 2025cs.NE cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

The open-pit mine scheduling problem (OPMSP) is a complex optimization problem in long-term mine planning that involves numerous operational and geological constraints. Traditional deterministic approaches often ignore geological uncertainty, leading to suboptimal or unreliable production schedules. Chance constraints provide a framework for handling uncertainty by ensuring that probabilistic constraints are satisfied with a predefined confidence level. In this paper, we consider the OPMSP under geological grade uncertainty and propose a bi-objective chance-constrained formulation that simultaneously maximizes the expected discounted net present value and minimizes scheduling risk. Unlike traditional chance-constrained approaches, the proposed formulation does not require a predefined confidence level during optimization. Instead, it generates a set of Pareto-optimal solutions representing different trade-offs between profitability and risk within a single optimization run. To solve the resulting large-scale stochastic optimization problem, we employ multi-objective evolutionary algorithms and compare their performance against a single-objective chance-constrained evolutionary approach and a deterministic MILP benchmark. We further evaluate the contribution of the problem-specific initialization and mutation components through an ablation study. Experimental results on MineLib benchmark instances containing up to 112 687 blocks demonstrate that the proposed formulation effectively captures the trade-off between profitability and risk under geological uncertainty while providing greater flexibility than confidence-level-dependent approaches.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 42 references that are in the map. First posted on arXiv 11 Nov 2025.

Builds on

11 of 42 references.

References · 11

  1. 2015Should we really use post-hoc tests based on mean-ranks?cited by 116
  2. 2020Recent Trends in the Use of Statistical Tests for Comparing Swarm and Evolutionary Computing Algorithms: Practical Guidelines and a Critical Reviewcited by 14
  3. 2020Optimizing Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-Objective Algorithmscited by 12
  4. 2021Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variablescited by 9
  5. 2022Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profitscited by 7
  6. 20233-Objective Pareto Optimization for Problems with Chance Constraintscited by 5
  7. 2021Heuristic Strategies for Solving Complex Interacting Stockpile Blending Problem with Chance Constraintscited by 4
  8. 2024Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problemcited by 4
  9. 2016A study of the Bienstock-Zuckerberg algorithm, Applications in Mining and Resource Constrained Project Schedulingcited by 3
  10. 2023Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discountingcited by 3
  11. 2021Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problemscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.