A New Semi-greedy Approach to Enhance Drillhole Planning

被引:4
|
作者
Dutaut, Raphael [1 ]
Marcotte, Denis [1 ]
机构
[1] Polytech Montreal, Civil Geol & Min Dept, CP 6079,Succ Ctr Ville, Montreal, PQ H3C 3A7, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Geostatistics; Infill drilling; Risk control; Semi-greedy optimization; Heuristic; OPTIMIZATION; SIMULATION; ALGORITHM;
D O I
10.1007/s11053-020-09674-8
中图分类号
P [天文学、地球科学];
学科分类号
07 ;
摘要
In advanced exploration projects or operating mines, the process of allocating capital for infill drilling programs is a significant and recurrent challenge. Within a large company, the different mine sites and projects compete for the available funds for drilling. To maximize a project's value to its company, a drillhole location optimizer can be used as an objective tool to compare drilling campaigns. The fast semi-greedy optimizer presented here can allow for the obtention of close to optimal solutions to the coverage problem with up to three orders of magnitude less computing time needed than with integer programming. The heuristic approach is flexible as it allows dynamic updating of block values once new drillholes are selected in the solution, as opposed to existing methods based on static block values. The block values used for optimization incorporate kriging estimate and variance, estimate of indicator at cutoff grade and distances to existing or newly selected drillholes. The heuristic approach tends to locate new drillholes within the maximum risk areas, i.e., within less informed zones predicted as being ore zones. Applied to different deposits, it enables, after suitable normalization, comparison of different drilling campaigns and allocation of budgets accordingly.
引用
收藏
页码:3599 / 3612
页数:14
相关论文
共 50 条
  • [1] A New Semi-greedy Approach to Enhance Drillhole Planning
    Raphaël Dutaut
    Denis Marcotte
    Natural Resources Research, 2020, 29 : 3599 - 3612
  • [2] SEMI-GREEDY HEURISTICS - AN EMPIRICAL-STUDY
    HART, JP
    SHOGAN, AW
    OPERATIONS RESEARCH LETTERS, 1987, 6 (03) : 107 - 114
  • [3] Equivalence between almost-greedy and semi-greedy bases
    Berna, P. M.
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2019, 470 (01) : 218 - 225
  • [4] A semi-greedy metaheuristic for the European cableway location problem
    Nils Egil Søvde
    Arne Løkketangen
    Richard L. Church
    Johan Oppen
    Journal of Heuristics, 2015, 21 : 641 - 662
  • [5] Weak Greedy Algorithms and the Equivalence Between Semi-greedy and Almost Greedy Markushevich Bases
    Miguel Berasategui
    Silvia Lassalle
    Journal of Fourier Analysis and Applications, 2023, 29
  • [6] A semi-greedy metaheuristic for the European cableway location problem
    Sovde, Nils Egil
    Lokketangen, Arne
    Church, Richard L.
    Oppen, Johan
    JOURNAL OF HEURISTICS, 2015, 21 (05) : 641 - 662
  • [7] Weak Greedy Algorithms and the Equivalence Between Semi-greedy and Almost Greedy Markushevich Bases
    Berasategui, Miguel
    Lassalle, Silvia
    JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, 2023, 29 (02)
  • [8] A Semi-Greedy Heuristic for the Mapping of Large Task Graphs
    Berger, Karl-Eduard
    Galea, Francois
    Le Cun, Bertrand
    Sirdey, Renaud
    2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2016, : 817 - 824
  • [9] Semi-Greedy Scheme for Slot Allocation in Vehicular Networks
    Mao, Yiwei
    Shen, Lianfeng
    2015 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS & SIGNAL PROCESSING (WCSP), 2015,
  • [10] Adaptive Semi-Greedy Search for Multidimensional Track Assignment
    Shapero, Samuel A.
    Hughes, Hunter
    Tuuk, Peter
    2016 19TH INTERNATIONAL CONFERENCE ON INFORMATION FUSION (FUSION), 2016, : 409 - 415