基于混匀配矿的露天矿山供应链建模与求解

Modeling and Solution of Open Pit Supply Chain Considering Ore Blending

摘要:

从供应链角度出发，分析原矿配矿的生产特点，考虑生产任务和生产能力限制、库存平衡约束、资源消耗量限制以及质量指标等要求，以生产、运输、库存总成本最小、所获得净利润最大及质量品位偏差最小为目标建立了01混合整数规划数学模型.采用拉格朗日松弛（LR）算法对该模型进行求解.仿真实验结果表明,中规模算例LR算法可以在较快时间内获得可行解，大规模算例可以在CPLEX软件求不到解的情况下运用LR算法在可接受时间内得到可行解.最后对出矿点品位参数进行了灵敏度分析，品位的扰动对质量偏差以及总目标函数值有较大的敏感性.

关键词:配矿; 供应链; 01混合整数规划; 拉格朗日松弛算法（LR）; 灵敏度分析

Abstract:

From the perspective of supply chain, this paper takes into consideration the production characteristics in ore blending process, and establishes a 01 mixedinteger program which aims at maximizing the profit and minimizing the deviation of product’s ore grade, and satisfies the constraints of production capacity, resource limits, inventory balancing and product quality requirements. The Lagrangian relaxation algorithm (LR) is adopted to solve the problem. Computational experiments show that LR could fast obtain the feasible solution for mediumscale instances, and could obtain the optimal solutions within reasonable time for largescale instances while CPLEX fails to obtain the feasible solutions. Besides, the sensitivity analysis on the grade parameters is conducted, and the results show that disturbance of the grade is a sensitive factor for the quality deviation and the general objective function value.

Key words:ore blending; supply chain; 01 mixed integer program; Lagrangian relaxation algorithm (LR); sensitivity analysis