返回
A hybrid heuristic algorithm for the open-pit-mining operational planning problem
DOI:10.1016/j.ejor.2010.05.031.png)
摘要
En 中文
This paper deals with the Open-Pit-Mining Operational Planning problem with dynamic truck allocation. The objective is to optimize mineral extraction in the mines by minimizing the number of mining trucks used to meet production goals and quality requirements. According to the literature, this problem is NP-hard, so a heuristic strategy is justified. We present a hybrid algorithm that combines characteristics of two metaheuristics: Greedy Randomized Adaptive Search Procedures and General Variable Neighborhood Search. The proposed algorithm was tested using a set of real-data problems and the results were validated by running the CPLEX optimizer with the same data. This solver used a mixed integer programming model also developed in this work. The computational experiments show that the proposed algorithm is very competitive, finding near optimal solutions (with a gap of less than 1%) in most instances, demanding short computing times. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Open-pit-mining
Metaheuristics
GRASP
Variable neighborhood search
Mathematical programming
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Reduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy轻度肝性脑病中白质微结构完整性降低与认知缺陷相关
Gut
IF0
LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity基于LP的分解方法,用于解决具有块处理选择性的露天采矿生产调度问题
没有更多内容

