具有机会约束的复杂相互作用库存调配问题的启发式求解策略
Heuristic Strategies for Solving Complex Interacting Stockpile Blending Problem with Chance Constraints
摘要:
启发式算法在解决各种优化问题方面表现出了良好的能力。库存调配问题作为矿山调度问题的重要组成部分,是一个在地质输入数据中含有不确定性的连续搜索空间的优化问题。优化过程的目标是最大限度地提高操作的材料总量,并符合资源容量、化学工艺和客户要求。在本文中,我们考虑材料等级的不确定性,并引入机会约束,用于确保具有高置信度的约束。为了解决库存混合问题的机会约束,我们提出了一种差分进化算法结合两个修复算子,用于解决这两个复杂的约束。在实验部分,我们比较了该方法的性能与确定性模型和随机模型,考虑不同的机会约束,并评估不同的机会约束的有效性。
英文摘要:
Heuristic algorithms have shown a good ability to solve a variety of optimization problems. Stockpile blending problem as an important component of the mine scheduling problem is an optimization problem with continuous search space containing uncertainty in the geologic input data. The objective of the optimization process is to maximize the total volume of materials of the operation and subject to resource capacities, chemical processes, and customer requirements. In this paper, we consider the uncertainty in material grades and introduce chance constraints that are used to ensure the constraints with high confidence. To address the stockpile blending problem with chance constraints, we propose a differential evolution algorithm combining two repair operators that are used to tackle the two complex constraints. In the experiment section, we compare the performance of the approach with the deterministic model and stochastic models by considering different chance constraints and evaluate the effectiveness of different chance constraints.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。