The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A combinatorial Artificial Bee Colony algorithm for traveling salesman problem
Abstract
Traveling Salesman Problem is an important optimization issue of many fields such as transportation, logistics and semiconductor industries and it is about finding a Hamiltonian path with minimum cost. To solve this problem, many researchers have proposed different approaches including metaheuristic methods. Artificial Bee Colony algorithm is a well known swarm based optimization technique. In this paper we propose a new Artificial Bee Colony algorithm called Combinatorial ABC for Traveling Salesman Problem. Simulation results show that this Artificial Bee Colony algorithm can be used for combinatorial optimization problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Cited by
A comprehensive survey: artificial bee colony (ABC) algorithm and applications
Karaboga, D., Gorkemli, B., Ozturk, C., & Karaboga, N. (2014) · Artificial Intelligence Review · doi:10.1007/s10462-012-9328-0 · Cited by 1,975
Self-citationTang, J., Liu, G., & Pan, Q. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1004129 · Cited by 996
Mahi, M., Baykan, Ö. K., & Kodaz, H. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.01.068 · Cited by 379
An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems
Osaba, E., Yang, X.-S., Diaz, F., Lopez-Garcia, P., & Carballedo, R. (2016) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2015.10.006 · Cited by 312
Multi-strategy ensemble artificial bee colony algorithm
Wang, H., Wu, Z., Rahnamayan, S., Sun, H., Liu, Y., & Pan, J.-S. (2014) · Information Sciences · doi:10.1016/j.ins.2014.04.013 · Cited by 263
Metadata
- Authors
- Karaboga, D., & Gorkemli, B.
- Venue
- 2011 International Symposium on Innovations in Intelligent Systems and Applications
- Publisher
- IEEE
- Published
- 2011-06
- Pages
- 50-53
- OpenAlex
- W2128995918
- Cited by
- 174
- References
- 1
- FWCI
- 9.55
- 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: A combinatorial Artificial Bee Colony algorithm for traveling salesman problem. https://app.cochat.ai/papers/10.1109/inista.2011.5946125
- The paper
- Karaboga, D., & Gorkemli, B. (2011). A combinatorial Artificial Bee Colony algorithm for traveling salesman problem. 2011 International Symposium on Innovations in Intelligent Systems and Applications. https://doi.org/10.1109/inista.2011.5946125
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.