The DOI matches its Crossref record.
A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
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
Cited by
Mirjalili, S. (2016) · Neural Computing and Applications · doi:10.1007/s00521-015-1920-1 · Cited by 2,765
Coyote optimization algorithm: A new metaheuristic for global optimization problems
Pierezan, J., & Dos Santos Coelho, L. (2018) · 2018 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2018.8477769 · Cited by 645
Crayfish optimization algorithm
Jia, H., Rao, H., Wen, C., & Mirjalili, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10567-4 · Cited by 644
Pigeon-inspired optimization: a new swarm intelligence optimizer for air robot path planning
Duan, H., & Qiao, P. (2014) · International Journal of Intelligent Computing and Cybernetics · doi:10.1108/ijicc-02-2014-0005 · Cited by 601
(2012) · Cited by 466
Metadata
- Authors
- Karaboga, D., & Basturk, B.
- Venue
- Journal of Global Optimization
- Published
- 2007-04-13
- Volume
- 39
- Issue
- 3
- Pages
- 459-471
- ISSN
- 0925-5001 (ISSN-L)
- 1573-2916
- OpenAlex
- W2143560894
- Cited by
- 7,651
- References
- 0
- FWCI
- 57.13
- Type
- journal article
- Language
- en
- Open access
- closed
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: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. https://app.cochat.ai/papers/10.1007/s10898-007-9149-x
- The paper
- Karaboga, D., & Basturk, B. (2007). A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization. https://doi.org/10.1007/s10898-007-9149-x
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.
