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

IF 9.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Swarm and Evolutionary Computation Pub Date : 2026-10-01 Epub Date: 2026-10-03 DOI:10.1016/j.swevo.2026.102543
Ishara Hewa Pathiranage, Aneta Neumann
{"title":"Bi-objective chance-constrained evolutionary optimization for large-scale open-pit mine scheduling under geological uncertainty","authors":"Ishara Hewa Pathiranage,&nbsp;Aneta Neumann","doi":"10.1016/j.swevo.2026.102543","DOIUrl":null,"url":null,"abstract":"<div><div>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 <span><math><mrow><mn>112</mn><mspace></mspace><mn>687</mn></mrow></math></span> 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.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"109 ","pages":"Article 102543"},"PeriodicalIF":9.6000,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650226002634","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/10/3 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

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 112687 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.
地质不确定性下大型露天矿调度的双目标机会约束演化优化
露天矿调度问题(OPMSP)是一个复杂的长期矿山规划优化问题,涉及许多操作和地质约束。传统的确定性方法往往忽略地质的不确定性,导致次优或不可靠的生产计划。机会约束通过确保概率约束满足预定义的置信度水平,为处理不确定性提供了一个框架。本文考虑了地质品位不确定性条件下的OPMSP问题,提出了一个同时使预期贴现净现值最大化和调度风险最小化的双目标机会约束公式。与传统的机会约束方法不同,所提出的公式在优化过程中不需要预定义的置信水平。相反,它生成一组帕累托最优解决方案,代表在单个优化运行中盈利能力和风险之间的不同权衡。为了解决由此产生的大规模随机优化问题,我们采用了多目标进化算法,并将其性能与单目标机会约束进化方法和确定性MILP基准进行了比较。我们通过消融研究进一步评估了问题特异性初始化和突变成分的贡献。在包含多达112687个区块的MineLib基准实例上的实验结果表明,所提出的公式有效地捕获了地质不确定性下盈利能力和风险之间的权衡,同时比依赖置信水平的方法提供了更大的灵活性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书