Global optimization of self-potential anomalies via HGS algorithm

In this paper, a novel global optimizer named Hunger Games Search (HGS) is adapted and presented for estimating the characteristics and model parameters of idealized geometrical causative structures from self-potential (SP) anomalies. After the modal analysis of assumed objective functions and the essential parameter tuning process, the HGS algorithm has been tested on some synthetic SP anomalies and four heterologous real data cases obtained from India, Türkiye, Canada, and Indonesia. In the synthetic and real data cases, multiple intercalating structures have been considered. The second moving average method has also been tested for removing the regional background. Additionally, the post-inversion uncertainty appraisal analyses have been implemented to better understand the reliability of the model parameter estimations. The solutions obtained through HGS have been systematically and thoroughly compared with the solutions of the well-established and popular Particle Swarm Optimization (PSO) in terms of convergence rate, robustness, stability, and accuracy. Applications have shown that SP anomalies can be inverted more effectively via HGS since the algorithm can explore the search space more extensively without being trapped into numerous local minima and approximate the global minimum more precisely. Thus, it is recommended to use the HGS algorithm in ore and mineral exploration studies as well as in studies aimed at delineating subsurface structures from geophysical data sets.

Authors

Institutions

Publication Details

Published
2024-08-23
DOI
https://doi.org/10.1190/gem2024-017.1
Primary Topic
Geophysical and Geoelectrical Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Global optimization of self-potential anomalies via HGS algorithm

Hanbing Ai, Kejia Su
Geophysical and Geoelectrical Methods
article

Global optimization of self-potential anomalies via HGS algorithm

Hanbing Ai, Kejia Su
article en

Abstract

In this paper, a novel global optimizer named Hunger Games Search (HGS) is adapted and presented for estimating the characteristics and model parameters of idealized geometrical causative structures from self-potential (SP) anomalies. After the modal analysis of assumed objective functions and the essential parameter tuning process, the HGS algorithm has been tested on some synthetic SP anomalies and four heterologous real data cases obtained from India, Türkiye, Canada, and Indonesia. In the synthetic and real data cases, multiple intercalating structures have been considered. The second moving average method has also been tested for removing the regional background. Additionally, the post-inversion uncertainty appraisal analyses have been implemented to better understand the reliability of the model parameter estimations. The solutions obtained through HGS have been systematically and thoroughly compared with the solutions of the well-established and popular Particle Swarm Optimization (PSO) in terms of convergence rate, robustness, stability, and accuracy. Applications have shown that SP anomalies can be inverted more effectively via HGS since the algorithm can explore the search space more extensively without being trapped into numerous local minima and approximate the global minimum more precisely. Thus, it is recommended to use the HGS algorithm in ore and mineral exploration studies as well as in studies aimed at delineating subsurface structures from geophysical data sets.

China University of Geosciences (Beijing) (CN)
Openalex Percentile: Top 85%
Geophysical and Geoelectrical Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.