The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained 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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Cited by
A comparative study of Artificial Bee Colony algorithm
Karaboga, D., & Akay, B. (2009) · Applied Mathematics and Computation · doi:10.1016/j.amc.2009.03.090 · Cited by 3,206
Self-citationVenkata Rao, R. (2016) · International Journal of Industrial Engineering Computations · doi:10.5267/j.ijiec.2015.8.004 · Cited by 2,071
Abdollahzadeh, B., Gharehchopogh, F. S., & Mirjalili, S. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2021.107408 · Cited by 1,438
Dhiman, G., & Kumar, V. (2019) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.11.024 · Cited by 1,195
A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications
Zhang, Y., Wang, S., & Ji, G. (2015) · Mathematical Problems in Engineering · doi:10.1155/2015/931256 · Cited by 1,146
Metadata
- Authors
- Karaboga, D., & Basturk, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-06-30
- Pages
- 789-798
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2134816084
- Cited by
- 1,407
- References
- 1
- FWCI
- 13.66
- Type
- conference paper
- 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: Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems. https://app.cochat.ai/papers/10.1007/978-3-540-72950-1_77
- The paper
- Karaboga, D., & Basturk, B. (2007). Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-72950-1_77
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.