.png){kind=icon}
.png){kind=icon}
Return
A 3D approximate hybrid algorithm for stope boundary optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2018.05.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Determining stope boundaries is one of the critical steps to be taken when an underground mining method is selected; because of their significant impact on the profitability of the mining project, the stope boundaries have to be optimum to achieve maximum profits. This paper introduces a new hybrid algorithm that is a combination of dynamic programming and greedy algorithm. Although this proposed algorithm may fail to provide a true optimum solution, it generates better solutions than existing algorithms do. The new proposed algorithm and three existing algorithms are used to find the optimal stope boundaries on a real case ore body. The results demonstrate that the proposed algorithm can improve the profit by 117.78%, 16.86% and 0.42% compared to Floating Stope, Maximum Value Neighborhood (MVN), and Greedy algorithm solutions, respectively, on a real case study at a reasonable CPU time. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Stope boundaries
Optimization
Hybrid algorithm
Dynamic programming
Greedy
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W