摘要
露天开采调度问题的相关研究通常采用块状矿床模型将露天矿体离散为块矿进行考虑,该模型是在给定的技术和经济条件下,以经济效益最大为目标,对露天矿中处于不同地理坐标位置的块矿的开采顺序及开采时间进行优化决策.本文根据实际生产过程特点,将开采过程中的规整性目标加入到经典块状矿床模型中进行考虑,进而建立了一个新的0-1整数规划模型.文章提出了一种拉格朗日松弛(LR)算法进行求解.首先利用优先级约束背包结构,根据块选择规则构建了有效不等式,使得求解时间明显缩短;其次,基于有向无环图结构设计了快速的可行解获得策略,还利用最早开始时间和最迟开始时间两种算法进行变量消除,减小问题求解规模;最后,通过真实的数值算例验证了文中算法的有效性,结果显示与标准求解软件CPLEX相比,本文设计的有效不等式和获得可行解的算法策略在求解时间上占有优势,同时能够在满足优先级顺序约束、生产约束以及开采的块矿所获净现值尽可能大的前提下,保证开采的过程是规整的.
Open pit mine production scheduling is to specify the sequence of blocks extraction from the mine so as to obtain the highest NPV satisfying a variety of physical and economical constraints. According to pro- Valid inequalities are established based on the knapsack structure of priority constraints to accelerate the algorithm without hurting the optimal solution; and then fast feasible solution strategy is constructed based on Directed Acyclic Graph structure; variable reductions are carried out to reduce the problem scale through strategies of earliest start time and latest start time. Computational results indicate that the proposed approach outperforms standard solver CPLEX in computational time. The proposed model and solution can realize the goal of regularity maintaining and profit maximizing while satisfying all production constraints.
作者
刘文博
孙德峰
唐立新
LIU Wen-bo;SUN De-feng;TANG Li-xin(Institute of Industrial ＆ Systems Engineering, Northeastern University, Shenyang 110819, China;Liaoning Provincial College of Communications, Shenyang 110122, China)
出处
《管理科学学报》
CSSCI
CSCD
北大核心
2017年第12期72-86,共15页
Journal of Management Sciences in China
基金
国家自然科学基金资助创新研究群体项目(71321001)
关键词
露天开采调度问题
0-1整数规划
拉格朗日松弛算法
有向无环图
open-pit mine production scheduling problem
0 - 1 integer programming
Lagrangian relaxation
directed acyclic graph
