Optimisation of stope limits using a heuristic approach

被引:15
作者
Ataee-pour, M [1 ]
机构
[1] Amir Kabir Univ Technol, Dept Min Met & Petr Engn, Tehran 15914, Iran
来源
TRANSACTIONS OF THE INSTITUTIONS OF MINING AND METALLURGY SECTION A-MINING TECHNOLOGY | 2004年 / 113卷 / 02期
关键词
stope limits; heuristic algorithm;
D O I
10.1179/037178404225004959
中图分类号
TD [矿业工程];
学科分类号
0819 ;
摘要
A heuristic algorithm, termed the maximum value neighbourhood (MVN), is proposed to optimise stope boundaries. The MVN algorithm uses a 3-D fixed economic block model to locate the best neighbourhood of a block, which guarantees the maximum net value. Neighbourhoods are restricted by the mine geometry constraints. The neighbourhood concept is based on the number of mining blocks equivalent to the minimum stope size. Since several neighbourhoods are available for each block, the one that provides the maximum net value is located for inclusion in the final stope. The MVN algorithm benefits from its simplicity in both concept and implementation. It provides a 3-D analysis and can be applied to any underground mining method, although it does not guarantee the true 'optimum' stope layout.
引用
收藏
页码:A123 / A128
页数:6
相关论文
共 6 条
[1]  
Alford C., 1995, 25 INT S APPL COMP O, P213
[2]  
ATAEEPOUR M, 2000, THESIS U WOLLONGONG, P1
[3]  
CHEIMANOFF NM, 1989, APPL COMP O, P471
[4]  
Deraisme J., 1984, 18 APCOM S LOND ENGL, P583
[5]  
Ovanic J., 1995, 3 CAN C COMP APPL MI, P129
[6]  
RIDDLE JM, 1977, 14 INT S APPL COMP O, P767