A quasi-opposition learning and chaos local search based on walrus optimization for global optimization problems

The Walrus Optimization (WO) algorithm, as an emerging metaheuristic algorithm, has shown excellent performance in problem-solving, however it still faces issues such as slow convergence and susceptibility to getting trapped in local optima. To this end, the study proposes a novel WO enhanced by quasi-oppositional-based learning and chaotic local search mechanisms, called QOCWO. The study aims to prevent premature convergence to local optima and enhance the diversity of the population by integrating the quasi-oppositional-based learning mechanism into the original Walrus Optimization (WO) algorithm, thereby improving the global search capability and expanding the search range. Additionally, the chaotic local search mechanism is introduced to accelerate the convergence speed of WO. To test the capabilities, the QOCWO algorithm is applied to the 23 standard functions and compared with seven other algorithms. Furthermore, the Wilcoxon rank-sum test is utilized to evaluate the significance of the results, which demonstrates the superior performance of the proposed algorithm. To assess the practicality in solving real-world problems, the QOCWO is applied to two engineering design issues, and the results indicated that QOCWO achieved lower costs compared to other algorithms.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-01-22
DOI
https://doi.org/10.1038/s41598-025-85751-3
Citations
8
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
19.85

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A quasi-opposition learning and chaos local search based on walrus optimization for global optimization problems

Zhichao Lian, Yu-Chen Dai, Yier Li, Kang Zhou et al.
8 citations
Scientific Reports
Metaheuristic Optimization Algorithms Research
19.85
article

A quasi-opposition learning and chaos local search based on walrus optimization for global optimization problems

Zhichao Lian, Yu-Chen Dai, Yier Li, Kang Zhou, Lei Li
article en
8 citations

Abstract

The Walrus Optimization (WO) algorithm, as an emerging metaheuristic algorithm, has shown excellent performance in problem-solving, however it still faces issues such as slow convergence and susceptibility to getting trapped in local optima. To this end, the study proposes a novel WO enhanced by quasi-oppositional-based learning and chaotic local search mechanisms, called QOCWO. The study aims to prevent premature convergence to local optima and enhance the diversity of the population by integrating the quasi-oppositional-based learning mechanism into the original Walrus Optimization (WO) algorithm, thereby improving the global search capability and expanding the search range. Additionally, the chaotic local search mechanism is introduced to accelerate the convergence speed of WO. To test the capabilities, the QOCWO algorithm is applied to the 23 standard functions and compared with seven other algorithms. Furthermore, the Wilcoxon rank-sum test is utilized to evaluate the significance of the results, which demonstrates the superior performance of the proposed algorithm. To assess the practicality in solving real-world problems, the QOCWO is applied to two engineering design issues, and the results indicated that QOCWO achieved lower costs compared to other algorithms.

Scientific ReportsVol. 15(1)
Zhejiang Normal University (CN), China Railway Corporation (CN), Jingdong (China) (CN)
Jinhua Science and Technology Bureau
Openalex Percentile: Top 1%
Metaheuristic Optimization Algorithms Research
19.85
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.