An improved hippopotamus optimization algorithm based on adaptive development and solution diversity enhancement

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.

Authors

Institutions

Publication Details

Journal
PeerJ Computer Science
Published
2025-05-29
DOI
https://doi.org/10.7717/peerj-cs.2901
Citations
1
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An improved hippopotamus optimization algorithm based on adaptive development and solution diversity enhancement

Shengyu Pei, Lang Tong, Gang Sun
1 citations
PeerJ Computer Science
Metaheuristic Optimization Algorithms Research
2.48
article

An improved hippopotamus optimization algorithm based on adaptive development and solution diversity enhancement

Shengyu Pei, Lang Tong, Gang Sun
article en
1 citations

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.

PeerJ Computer ScienceVol. 11
Guangxi University of Finance and Economics (CN)
Openalex Percentile: Top 10%
Metaheuristic Optimization Algorithms Research
2.48
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.