ArticlePeerJ. Computer science2025
An improved hippopotamus optimization algorithm based on adaptive development and solution diversity enhancement.
Article in PeerJ. Computer science, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
This study proposes an improved hippopotamus optimization algorithm to address the limitations of the traditional hippopotamus optimization algorithm in terms of convergence performance and solution diversity in complex high-dimensional problems. Inspired by the natural behavior of hippopotamuses, this article introduces chaotic map initialization, an adaptive exploitation mechanism, and a solution diversity enhancement strategy based on the original algorithm. The chaotic map is employed to optimize the initial population distribution, thereby enhancing the global search capability. The adaptive exploitation mechanism dynamically adjusts the weights between the exploration and exploitation phases to balance global and local searches. The solution diversity enhancement is achieved through the introduction of nonlinear perturbations, which help the algorithm avoid being trapped in local optima. The proposed algorithm is validated on several standard benchmark functions (CEC17, CEC22), and the results demonstrate that the improved algorithm significantly outperforms the original hippopotamus optimization algorithm and other mainstream optimization algorithms in terms of convergence speed, solution accuracy, and global search ability. Moreover, statistical analysis further confirms the superiority of the improved algorithm in balancing exploration and exploitation, particularly when dealing with high-dimensional multimodal functions. This study provides new insights and enhancement strategies for the application of the hippopotamus optimization algorithm in solving complex optimization problems.
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.