Evidence map›Paper›PMID 42288676›Full record

ArticleScientific reports2026

DS-ARO: a multi-strategy improved artificial rabbits optimization algorithm for global optimization and corporate bankruptcy prediction.

Xiran Bai, Yuchi Li

Abstract read
In one paragraph

Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Xiran BaiSchool of Mathematics, Southwestern University of Finance and Economics, Chengdu, 611130, China.
Yuchi LiSchool of Labor Economics, China University of Labor Relations, Beijing, 100048, China. 15549925998@163.com.

Funding

National Undergraduate Innovation Training Program at the China University of Labor Relations Project No. 124532025001
6 · The paper itself

Abstract

To address the limitations of the Artificial Rabbits Optimization (ARO) algorithm in solving complex high-dimensional and multimodal optimization problems-such as insufficient convergence guidance, weak balance between exploration and exploitation, and lack of adaptive search control-this paper proposes a novel dual-strategy enhanced ARO algorithm, termed DS-ARO. The proposed method integrates three complementary mechanisms: (1) a convergence-diversity balanced mutation strategy based on current-to-pbest/1 to simultaneously enhance convergence pressure and population diversity; (2) an adaptive elite-guided search mechanism to improve the reliability of search directions and convergence stability through elite learning and adaptive perturbation control; and (3) a success-rate-based strategy selection mechanism to dynamically adjust the usage probability of different search strategies according to real-time optimization performance. To comprehensively evaluate the effectiveness of the proposed algorithm, extensive experiments are conducted on the CEC2017 (30-dimensional) and CEC2022 (10- and 20-dimensional) benchmark test suites, and compared with several state-of-the-art metaheuristic algorithms. Statistical analyses, including the Friedman test and Wilcoxon signed-rank test, are further employed to verify the significance of performance improvements. In addition, ablation studies are performed to quantify the contribution of each proposed strategy. The experimental results demonstrate that DS-ARO consistently achieves superior optimization accuracy, faster convergence speed, and stronger robustness compared with the competing algorithms. Furthermore, the proposed DS-ARO is applied to the hyperparameter optimization of the K-Nearest Neighbors (KNN) model for corporate bankruptcy prediction. Experimental results on the Wieslaw financial dataset show that the DS-ARO-KNN model outperforms traditional KNN and several mainstream machine learning models, achieving higher accuracy, precision, recall, and F1-score, while effectively reducing misclassification risks.

Indexed as

Artificial rabbits optimizationBankruptcy predictionHyperparameter optimizationK-nearest neighborsMetaheuristic optimization

Identifiers

PMID42288676
PMCPMC13521899

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

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.