A Simulated Annealing-Based Algorithm to Locate Additional Drillholes for Maximizing the Realistic Value of Information

被引:0
|
作者
Soltani-Mohammadi S. [1 ]
Hezarkhani A. [2 ]
机构
[1] Department of Mining Engineering, University of Kashan, 6km Ravand, Kashan
[2] Department of Mining and Metallurgy Engineering, Amirkabir University of Technology, Tehran
关键词
exploratory drilling; exploratory information system; Optimization; realistic value of information;
D O I
10.1007/s11053-013-9212-x
中图分类号
学科分类号
摘要
Locating additional drillholes based on information gathered from the initial drilling is a very difficult decision-making step in the process of detailed explorations. The most appropriate locations for additional drillholes are those wherein the information gathered from drilling has more value compared to that from other locations. From among the common methods proposed in information systems for measuring the information value, use of the "realistic value" is a very practical one. The realistic value of information is derived from measuring the differences in the decision makers' performances when provided with different information sets. On this basis, a mathematical model has been proposed in this paper for optimal location of additional drillholes where the information gathered from drillholes has the highest possible value. Due to the combinatorial nature of this model, use has been made of a simulated annealing-based algorithm for its solution. The proposed model has been applied in Sungun copper deposit for locating additional drillholes; results have revealed that the model is valid. © 2013 International Association for Mathematical Geosciences.
引用
收藏
页码:229 / 237
页数:8
相关论文
共 50 条
  • [1] A simulated annealing-based algorithm for selecting balanced samples
    Benedetti, Roberto
    Dickson, Maria Michela
    Espa, Giuseppe
    Pantalone, Francesco
    Piersimoni, Federica
    COMPUTATIONAL STATISTICS, 2022, 37 (01) : 491 - 505
  • [2] A simulated annealing-based multiobjective optimization algorithm: AMOSA
    Bandyopadhyay, Sanghamitra
    Saha, Sriparna
    Maulik, Ujjwal
    Deb, Kalyanmoy
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2008, 12 (03) : 269 - 283
  • [3] A simulated annealing-based algorithm for selecting balanced samples
    Roberto Benedetti
    Maria Michela Dickson
    Giuseppe Espa
    Francesco Pantalone
    Federica Piersimoni
    Computational Statistics, 2022, 37 : 491 - 505
  • [4] A simulated annealing-based optimization algorithm for process planning
    Ma, GH
    Zhang, YF
    Nee, AYC
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (12) : 2671 - 2687
  • [5] A simulated annealing-based learning algorithm for Boolean DNF
    Albrecht, A
    Steinhöfel, K
    ADVANCED TOPICS IN ARTIFICIAL INTELLIGENCE, 1999, 1747 : 193 - 204
  • [6] A simulated annealing-based maximum-margin clustering algorithm
    Seifollahi, Sattar
    Bagirov, Adil
    Borzeshi, Ehsan Zare
    Piccardi, Massimo
    COMPUTATIONAL INTELLIGENCE, 2019, 35 (01) : 23 - 41
  • [7] Simulated Annealing-Based Krill Herd Algorithm for Global Optimization
    Wang, Gai-Ge
    Guo, Lihong
    Gandomi, Amir Hossein
    Alavi, Amir Hossein
    Duan, Hong
    ABSTRACT AND APPLIED ANALYSIS, 2013,
  • [8] Genetic Simulated Annealing-Based Kernel Vector Quantization Algorithm
    Zhao, Mengling
    Yin, Xinyu
    Yue, Huiping
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2017, 31 (05)
  • [9] A Simulated Annealing-Based Multiobjective Optimization Algorithm for Political Districting
    Lara, A.
    Gutierrez, M. A.
    Rincon, E. A.
    IEEE LATIN AMERICA TRANSACTIONS, 2018, 16 (06) : 1723 - 1731
  • [10] Simulated Annealing-based Ontology Matching
    Mohammadi, Majid
    Hofman, Wout
    Tan, Yao-Hua
    ACM TRANSACTIONS ON MANAGEMENT INFORMATION SYSTEMS, 2019, 10 (01)