ArticleScientific reports2025
Dynamic gold rush optimizer: fusing worker adaptation and salp navigation mechanism for enhanced search.
Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
5 citing papers in PubMed.
- Research on a multi-strategy enhanced parrot optimization algorithm STPO for Complex optimization problems and its applications.Scientific reports · 2026Article
- Enhanced opposition-based American zebra optimization algorithm for global optimization.Scientific reports · 2026Article
- Parameter Estimation in photovoltaic systems using a hybrid Bat and crow metaheuristic algorithm.Scientific reports · 2026Article
- Enhanced crested porcupine optimizer for numerical optimization and wireless sensor network deployment.Scientific reports · 2025Article
- Levy flight-assisted hybrid Sine-Cosine Aquila optimizer for solving chemical equilibrium problems through the Gibbs free energy minimization technique.Scientific reports · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
The Dynamic Gold Rush Optimizer (DGRO) is presented as an advanced variant of the original Gold Rush Optimizer (GRO), addressing its inherent limitations in exploration and exploitation. While GRO has demonstrated efficacy in solving optimization problems, its susceptibility to premature convergence and suboptimal solutions remains a critical challenge. To overcome these limitations, DGRO introduces two novel mechanisms: the Salp Navigation Mechanism (SNM) and the Worker Adaptation Mechanism (WAM). The SNM enhances both exploration and exploitation by dynamically guiding the population through a stochastic strategy that ensures effective navigation of the solution space. This mechanism also facilitates a smooth transition between exploration and exploitation, enabling the algorithm to maintain diversity during early iterations and refine solutions in later stages. Complementing this, the WAM strengthens the exploration phase by promoting localized interactions among individuals within the population, fostering adaptive learning of promising search regions. Together, these mechanisms significantly improve DGRO's ability to converge toward global optima. A comprehensive experimental evaluation was conducted using benchmark functions from the Congress on Evolutionary Computation (CEC) CEC2013 and CEC2020 test suites across 30 and 50-dimensional spaces, alongside seven complex engineering optimization problems. Statistical analyses, including the Wilcoxon Rank-Sum Test (WRST) and Friedman Rank Test (FRT), validate DGRO's superior performance, demonstrating significant advancements in optimization capability and stability. These findings underscore the effectiveness of DGRO as a competitive and robust optimization algorithm.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.