arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.18213math.OC
收藏

基于大邻域搜索的长期露天矿规划

Long-Term Open-Pit Mine Planning with Large Neighbourhood Search

Michelle Blom, Adrian R. Pearce, Pascal Cote

AI总结:

本文提出基于大邻域搜索的长期露天矿规划方法,通过滑动窗口生成初始解并反复求解受限混合整数规划,显著缩短大型模型求解时间,已在力拓公司实际应用并产生数百万美元价值。

摘要:

我们提出了一种基于大邻域搜索的方法,用于求解复杂的长期露天矿规划问题。初始可行解由滑动窗口启发式算法生成,随后通过反复求解一个受限混合整数规划来改进该解。每次迭代仅允许规划模型中的一部分变量自由取新值。我们通过利用模型结构的邻域形成策略来构造这些变量子集。我们证明,对于商用求解器无法在合理时间范围内或合理计算资源下求解的问题,我们的方法能够找到近最优解。我们的方法大幅缩短了大型模型所需的求解时间,使矿山规划人员能够及时探索多种情景。该方法正被力拓公司用于求解大型长期矿山规划问题,并已产生了数百万美元的价值洞察。

英文摘要:

We present a Large Neighbourhood Search based approach for solving complex long-term open-pit mine planning problems. An initial feasible solution, generated by a sliding windows heuristic, is improved through repeated solves of a restricted mixed-integer program. Each iteration leaves only a subset of the variables in the planning model free to take on new values. We form these subsets through the use of neighbourhood formation strategies that exploit model structure. We show that our approach is able to find near-optimal solutions to problems that cannot be solved by an off-the-shelf solver in a reasonable time frame, or with reasonable computational resources. Our method substantially reduces the solve times required for large models, allowing mine planners to explore multiple scenarios in a timely fashion. Our approach is being used by Rio Tinto to solve large long-term mine planning problems, and has been responsible for generating millions of dollars in value insights.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑