Short-term underground mine planning with uncertain activity durations using constraint programming

IF 1.4 4区 工程技术 Q4 ENGINEERING, MANUFACTURING
Younes Aalian, Michel Gamache, Gilles Pesant
{"title":"Short-term underground mine planning with uncertain activity durations using constraint programming","authors":"Younes Aalian, Michel Gamache, Gilles Pesant","doi":"10.1007/s10951-024-00808-x","DOIUrl":null,"url":null,"abstract":"<p>The short-term scheduling of activities in underground mines is an important step in mining operations. This procedure is a challenging optimization problem since it deals with many resources and activities conducted in a confined working space. Moreover, underground mining operations deal with multiple uncertainties such as the variation of activity durations. In this paper, a constraint programming (CP) model is proposed for short-term planning in underground mines. The developed model takes into account the technical requirements of underground operations to build realistic mine schedules. Furthermore, two different approaches are proposed based on the CP model for robust short-term underground mine scheduling. The first approach aims to create a robust schedule using multiple scenarios of the problem. This stochastic CP model enables to find a set of ordered robust sequences of activities performed by each available disjunctive resource over several scenarios. In the second approach, a confidence constraint is introduced in the CP model to specify the probability that the schedule generated would not underestimate the duration of activities. The model allows the mine planner to control the risk level with which an optimized solution should be produced such that it can be implemented given the actual activity durations. The presented approaches are tested on real data sets of an underground gold mine in Canada. An evaluation model is designed to evaluate the robust performance of the proposed models. The experiments demonstrate that both scenario-based and confidence-constraint approaches outperform the deterministic model by generating schedules that are more robust to uncertainties in underground operations.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Scheduling","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s10951-024-00808-x","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0

Abstract

The short-term scheduling of activities in underground mines is an important step in mining operations. This procedure is a challenging optimization problem since it deals with many resources and activities conducted in a confined working space. Moreover, underground mining operations deal with multiple uncertainties such as the variation of activity durations. In this paper, a constraint programming (CP) model is proposed for short-term planning in underground mines. The developed model takes into account the technical requirements of underground operations to build realistic mine schedules. Furthermore, two different approaches are proposed based on the CP model for robust short-term underground mine scheduling. The first approach aims to create a robust schedule using multiple scenarios of the problem. This stochastic CP model enables to find a set of ordered robust sequences of activities performed by each available disjunctive resource over several scenarios. In the second approach, a confidence constraint is introduced in the CP model to specify the probability that the schedule generated would not underestimate the duration of activities. The model allows the mine planner to control the risk level with which an optimized solution should be produced such that it can be implemented given the actual activity durations. The presented approaches are tested on real data sets of an underground gold mine in Canada. An evaluation model is designed to evaluate the robust performance of the proposed models. The experiments demonstrate that both scenario-based and confidence-constraint approaches outperform the deterministic model by generating schedules that are more robust to uncertainties in underground operations.

Abstract Image

利用约束编程进行活动持续时间不确定的短期地下矿山规划
地下采矿活动的短期调度是采矿作业中的一个重要步骤。这个过程是一个具有挑战性的优化问题,因为它涉及到许多资源和在有限工作空间内开展的活动。此外,地下采矿作业还涉及多种不确定因素,如活动持续时间的变化。本文针对地下矿山的短期规划提出了一种约束编程(CP)模型。所开发的模型考虑了井下作业的技术要求,以制定切实可行的矿山计划。此外,本文还基于 CP 模型提出了两种不同的方法,用于制定稳健的短期地下矿山计划。第一种方法旨在利用问题的多种情景创建稳健的计划。这种随机 CP 模型能够在多个情景中找到一组有序的稳健活动序列,这些序列由每个可用的互不相关资源执行。在第二种方法中,CP 模型中引入了置信度约束,以规定生成的时间表不会低估活动持续时间的概率。通过该模型,矿山规划人员可以控制产生优化方案的风险水平,以便在实际活动持续时间的情况下实施优化方案。所介绍的方法在加拿大一个地下金矿的真实数据集上进行了测试。设计了一个评估模型来评估所提出模型的稳健性能。实验结果表明,基于情景和置信度约束的方法都优于确定性模型,它们生成的时间表对地下作业中的不确定性具有更强的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Scheduling
Journal of Scheduling 工程技术-工程:制造
CiteScore
3.80
自引率
10.00%
发文量
49
审稿时长
6-12 weeks
期刊介绍: The Journal of Scheduling provides a recognized global forum for the publication of all forms of scheduling research. First published in June 1998, Journal of Scheduling covers advances in scheduling research, such as the latest techniques, applications, theoretical issues and novel approaches to problems. The journal is of direct relevance to the areas of Computer Science, Discrete Mathematics, Operational Research, Engineering, Management, Artificial Intelligence, Construction, Distribution, Manufacturing, Transport, Aerospace and Retail and Service Industries. These disciplines face complex scheduling needs and all stand to gain from advances in scheduling technology and understanding.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信