.png){kind=icon}
.png){kind=icon}
Return
Dholes Hunting-A Multi-Local Search Algorithm Using Gradient Approximation and Its Application for Blockchain Consensus Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2024.3419172.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This study introduces a brand-new swarm-inspired algorithm dubbed dholes hunting-based optimization (DhoH) based on an animal hunting strategy to solve global optimization problems. The technique is a brilliant idea for simultaneously finding many local minima. The dhole's hunting strategy is coordinated by members of a swarm, clustering and chasing prey. A clustering approach and finding an optimal global algorithm describe primarily based on gradient approximation. We use four benchmark function datasets to evaluate the DhoH's performance. We compare the achieved results with several previous research from various well-known algorithms. The comparisons demonstrate that DhoH is better than other meta-heuristic algorithms in most cases and determines high-quality solutions with fewer control parameters. Besides, we also explore the application of DhoH in optimizing the decentralized level of Meta-heuristic Proof of Criteria consensus protocol (MPoC) in Blockchain Network to further demonstrate its potential in multi-dimensional problems. The results show the superior effectiveness of DhoH in terms of computational burden and solution precision compared with the existing optimization techniques in the literature.
Keywords:
Clustering algorithms
Approximation algorithms
Metaheuristics
Blockchains
Search problems
Mathematical models
Particle swarm optimization
Dholes hunting-based optimization
nature-inspired computing
swarm-inspired meta-heuristics
global search optimization
MPoC consensus protocol
blockchain network
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W