On the Use of Evolutionary Optimization for the Dynamic Chance Constrained Open-Pit Mine Scheduling Problem

2026-04-15 · Source: Artificial Intelligence · Field: Manufacturing & Industrial — Manufacturing Operations & Management, Automation & Robotics · Depth: Expert, quick

Summary

A new study addresses the dynamic chance-constrained open-pit mine scheduling problem, which involves stochastic block economic values and time-varying mining and processing capacities. This complex real-world optimization challenge is tackled using a bi-objective evolutionary formulation designed to maximize expected discounted profit while simultaneously minimizing its standard deviation. To manage dynamic changes, the researchers introduce a diversity-based change response mechanism. This mechanism repairs infeasible solutions and injects new feasible solutions upon detecting environmental shifts. The effectiveness of this approach was evaluated across four multi-objective evolutionary algorithms and compared against a re-evaluation-based baseline strategy. Experiments on six mining instances showed that the proposed method consistently outperformed baseline techniques under various uncertainty levels and change frequencies.

Key takeaway

For AI Scientists developing optimization solutions for resource extraction, this research indicates that integrating a diversity-based change response mechanism into bi-objective evolutionary algorithms can significantly improve performance in dynamic, uncertain open-pit mine scheduling. You should consider adopting this approach to enhance the robustness and profitability of your scheduling models, especially when dealing with stochastic economic values and fluctuating capacities.

Key insights

Evolutionary optimization effectively manages dynamic, uncertain open-pit mine scheduling by balancing profit and risk.

Principles

• Evolutionary algorithms adapt to uncertain environments.
• Bi-objective optimization balances profit and risk.
• Diversity-based response mechanisms handle dynamic changes.

Method

A bi-objective evolutionary formulation maximizes expected discounted profit and minimizes its standard deviation, employing a diversity-based change response to repair and introduce solutions upon detecting environmental changes.

In practice

• Apply bi-objective EAs for profit/risk trade-offs.
• Implement diversity-based repair for dynamic systems.
• Test against re-evaluation baselines for performance.

Topics

• Open-Pit Mine Scheduling
• Evolutionary Optimization
• Dynamic Chance-Constrained
• Bi-objective Optimization
• Diversity-Based Change Response

Best for: AI Scientist, Research Scientist

Related on AIssential

• On the Use of Evolutionary Optimization for the Dynamic Chance Constrained Open-Pit Mine Scheduling Problem — A diversity-based evolutionary approach effectively optimizes dynamic, uncertain open-pit mine schedules by balancing profit and risk.
• Adaptive mine planning under geological uncertainty: A POMDP framework for sequential decision-making — Sequential belief updating transforms geological uncertainty into an active component of value creation in mine planning.
• Diversity-Driven Offline Multi-Objective Optimization via Nested Pareto Set Learning — Offline multi-objective optimization can achieve diverse, high-quality Pareto sets by mitigating OOD issues and learning nested preferences.
• Online LLM Selection via Constrained Bandits with Time-Varying Demand — Online LLM selection under dynamic demand and hard/soft constraints can be optimized using constrained bandit learning.
• Solving the Wrong Problem Works Better - Robert Lange — Shinka Evolve uses LLMs and evolutionary algorithms for sample-efficient program generation and scientific discovery.
• The Free-Market Algorithm: Self-Organizing Optimization for Open-Ended Complex Systems — FMA is a novel metaheuristic using emergent fitness and open-ended search via market dynamics.

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by Artificial Intelligence.