Exploring Deep Learning for Dig-Limit Optimization in Open-Pit Mines

被引:20
作者
Williams, Jacob [1 ]
Singh, Jagjit [1 ]
Kumral, Mustafa [1 ]
Ruiseco, Julian Ramirez [1 ]
机构
[1] McGill Univ, Dept Min & Mat Engn, Adams Bldg,Room 119,3450 Univ St, Montreal, PQ H3A 0E8, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Deep learning; Mine planning; Genetic algorithms; Computer vision; Dig-limit optimization; Constrained optimization; NEURAL-NETWORKS; MODEL;
D O I
10.1007/s11053-021-09864-y
中图分类号
P [天文学、地球科学];
学科分类号
07 ;
摘要
This paper explored a convolutional neural network to assess the clustering of selective mining units (SMUs), generated by a genetic algorithm (GA) approach. The purpose of the GA was to optimize a set of dig limits in a mine bench. Dig limits are boundaries to separate/split SMUs as per waste and other processing categorizations so they can be feasibly and profitably be extracted by existing mining infrastructure. This was achieved by involving the cluster design and the affiliated decision variables into existing mining optimization frameworks that enhance the process's efficiency and thereby increase profitability. However, the catch being that such computation comes costly both from a monetary and time consumption perceptive. This paper aimed to address this very cost issue and how to overcome this with the use of deep learning. Specifically applying the statistical learning algorithms to assess the cluster quality of the GA computed dig limit, as current assessment methodology consumes up to 70 percent of the total computation time. Short-term mine planning applications need to be directly usable by mine operators' personnel and must be generated quickly to be useful in dynamic mining environments. This requirement shall save up time and cost. A case study was conducted on a bench with multiple destinations and 420 SMUs to test whether a convolutional neural network (CNN) can make predictions on clustering quality and discover the best CNN architecture for the task. The case study showed that using a CNN does ensure prediction accuracy and can speed up the time of computation time by 3900%.
引用
收藏
页码:2085 / 2101
页数:17
相关论文
共 48 条
[1]  
[Anonymous], 2010, Ant colony optimization
[2]  
Back Thomas., 1996, Evolutionary Algorithms in Theory and Practice, DOI DOI 10.1093/OSO/9780195099713.001.0001
[3]  
Batista GE., 2004, ACM SIGKDD EXPL NEWS, V6, P20, DOI [DOI 10.1145/1007730.1007735, 10.1145/1007730.1007735]
[4]  
Chollet F., 2015, KERAS 20 COMPUTER SO
[5]  
Coello Carlos A. Coello, 2007, Evolutionary Algorithms for Solving Multi-Objective Problems
[6]  
Colin A., 2007, REAL-TIME SYST, V18
[7]  
Deng J, 2009, PROC CVPR IEEE, P248, DOI 10.1109/CVPRW.2009.5206848
[8]  
Glorot X., 2010, Proceedings of the thirteenth international conference on artificial intelligence and statistics, P249, DOI DOI 10.1109/LGRS.2016.2565705
[9]  
Hagan MT., 1996, Neural network design
[10]   Deep Residual Learning for Image Recognition [J].
He, Kaiming ;
Zhang, Xiangyu ;
Ren, Shaoqing ;
Sun, Jian .
2016 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2016, :770-778