The DOI matches its Crossref record; 78 of the 78 references it cites were found in a registry or an index.
Secretary bird optimization algorithm: a new metaheuristic for solving global optimization problems
Open accessAbstract
This study introduces a novel population-based metaheuristic algorithm called secretary bird optimization algorithm (SBOA), inspired by the survival behavior of secretary birds in their natural environment. Survival for secretary birds involves continuous hunting for prey and evading pursuit from predators. This information is crucial for proposing a new metaheuristic algorithm that utilizes the survival abilities of secretary birds to address real-world optimization problems. The algorithm's exploration phase simulates secretary birds hunting snakes, while the exploitation phase models their escape from predators. During this phase, secretary birds observe the environment and choose the most suitable way to reach a secure refuge. These two phases are iteratively repeated, subject to termination criteria, to find the optimal solution to the optimization problem. To validate the performance of SBOA, experiments were conducted to assess convergence speed, convergence behavior, and other relevant aspects. Furthermore, we compared SBOA with 15 advanced algorithms using the CEC-2017 and CEC-2022 benchmark suites. All test results consistently demonstrated the outstanding performance of SBOA in terms of solution quality, convergence speed, and stability. Lastly, SBOA was employed to tackle 12 constrained engineering design problems and perform three-dimensional path planning for Unmanned Aerial Vehicles. The results demonstrate that, compared to contrasted optimizers, the proposed SBOA can find better solutions at a faster pace, showcasing its significant potential in addressing real-world optimization problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
2 retracted
Cheng, M., & Sholeh, M. N. (2023) · Knowledge-Based Systems · doi:10.1016/j.knosys.2023.110939 · Cited by 92
RetractedChen, B., Chen, H., & Li, M. (2021) · Complexity · doi:10.1155/2021/9985185 · Cited by 14
RetractedKennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2013.12.007 · Cited by 19,343
The Whale Optimization Algorithm
Mirjalili, S., & Lewis, A. (2016) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2016.01.008 · Cited by 14,581
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
GSA: A Gravitational Search Algorithm
Rashedi, E., Nezamabadi-pour, H., & Saryazdi, S. (2009) · Information Sciences · doi:10.1016/j.ins.2009.03.004 · Cited by 7,358
Holland, J. H. (1992) · Scientific American · doi:10.1038/scientificamerican0792-66 · Cited by 5,764
Cited by
Zhu, Y., Zhang, M., Huang, Q., Wu, X., Wan, L., & Huang, J. (2025) · Scientific Reports · doi:10.1038/s41598-025-87285-0 · Cited by 42
Metadata
- Authors
- Fu, Y., Liu, D., Chen, J., & He, L.
- Venue
- Artificial Intelligence Review
- Published
- 2024-04-23
- Volume
- 57
- Issue
- 5
- ISSN
- 0269-2821 (ISSN-L)
- 1573-7462
- OpenAlex
- W4395046137
- Cited by
- 487
- References
- 78
- FWCI
- 72.77
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Secretary bird optimization algorithm: a new metaheuristic for solving global optimization problems. https://app.cochat.ai/papers/10.1007/s10462-024-10729-y
- The paper
- Fu, Y., Liu, D., Chen, J., & He, L. (2024). Secretary bird optimization algorithm: a new metaheuristic for solving global optimization problems. Artificial Intelligence Review. https://doi.org/10.1007/s10462-024-10729-y
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.