arXiv — cs.AI preprintsInternational7 October 2026
On the use of evolutionary optimization for the dynamic chance constrained open-pit mine scheduling problem
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2604.13385v3 Announce Type: replace-cross Abstract: Open-pit mine scheduling is a complex real-world optimization problem that involves uncertain economic values and dynamically changing resource capacities. Evolutionary algorithms are particularly effective in these scenarios, as they can easily adapt to uncertain and changing environments. However, uncertainty and dynamic changes are often studied in isolation in real-world problems. In this paper, we study a dynamic chance-constrained open-pit mine scheduling problem in which block economic values are stochastic and mining and process
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- GAMEGO: Training Game-Dev Agents with Synthetic Trajectories Anchored in Real-World Assets7 October 2026
- Text2Dashboard: A Governed Agent Architecture for Natural-Language Dashboard Generation over Enterprise DataBrain7 October 2026
- FluidPD: In-Place Elasticity for SLO-Aware Prefill-Decode Disaggregated LLM Serving7 October 2026
- Anchor Divergence for Semantic Geometry in Contrastive Learning7 October 2026
- RadOnc-Agent: An LLM-Orchestrated Framework for AI Workflows Across the Radiotherapy Care Pathway7 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.