The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Ant Colony Optimization
Open accessAbstract
The introduction of ant colony optimization (ACO) and to survey its most notable applications are discussed. Ant colony optimization takes inspiration from the forging behavior of some ant species. These ants deposit Pheromone on the ground in order to mark some favorable path that should be followed by other members of the colony. The model proposed by Deneubourg and co-workers for explaining the foraging behavior of ants is the main source of inspiration for the development of ant colony optimization. In ACO a number of artificial ants build solutions to an optimization problem and exchange information on their quality through a communication scheme that is reminiscent of the one adopted by real ants. ACO algorithms is introduced and all ACO algorithms share the same idea and the ACO is formalized into a meta-heuristics for combinatorial problems. It is foreseeable that future research on ACO will focus more strongly on rich optimization problems that include stochasticity.
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
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
Self-citationGlover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
AntNet: Distributed Stigmergetic Control for Communications Networks
Di Caro, G., & Dorigo, M. (1998) · Journal of Artificial Intelligence Research · doi:10.1613/jair.530 · Cited by 1,579
Self-citationGrassé, P.-P. (1959) · Insectes Sociaux · doi:10.1007/bf02223791 · Cited by 1,236
Collective Robotics: From Social Insects to Robots
Kube, C. R., & Zhang, H. (1993) · Adaptive Behavior · doi:10.1177/105971239300200204 · Cited by 338
Cited by
A review on genetic algorithm: past, present, and future
Katoch, S., Chauhan, S. S., & Kumar, V. (2021) · Multimedia Tools and Applications · doi:10.1007/s11042-020-10139-6 · Cited by 4,655
Particle Swarm Optimization: A Comprehensive Survey
Shami, T. M., El-Saleh, A. A., Alswaitti, M., Al-Tashi, Q., Summakieh, M. A., & Mirjalili, S. (2022) · IEEE Access · doi:10.1109/access.2022.3142859 · Cited by 1,584
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
Bio inspired computing – A review of algorithms and scope of applications
Kar, A. K. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.04.018 · Cited by 578
Badran, O., Mekhilef, S., Mokhlis, H., & Dahalan, W. (2017) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2017.02.010 · Cited by 214
Benchmarking in Optimization: Best Practice and Open Issues
Bartz-Beielstein, T., Doerr, C., Berg, D. V. D., Bossek, J., Chandrasekaran, S., Eftimov, T., Fischbach, A., Kerschke, P., La Cava, W., Lopez-Ibanez, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2007.03488 · Cited by 214
Merrikh-Bayat, F. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.04.048 · Cited by 134
Kazmi, H., Mehmood, F., Lodeweyckx, S., & Driesen, J. (2018) · Energy · doi:10.1016/j.energy.2017.12.019 · Cited by 109
Niknam, M., & Thulasiraman, P. (2020) · Education and Information Technologies · doi:10.1007/s10639-020-10133-3 · Cited by 102
Cyberbullying Sexism Harassment Identification by Metaheurustics-Tuned eXtreme Gradient Boosting
Dobrojevic, M., Jovanovic, L., Babic, L., Cajic, M., Zivkovic, T., Zivkovic, M., Muthusamy, S., Antonijevic, M., & Bacanin, N. (2024) · Computers, Materials & Continua · doi:10.32604/cmc.2024.054459 · Cited by 75
Agentic Large Language Models, a Survey
Plaat, A., Van Duijn, M., Van Stein, N., Preuss, M., Van der Putten, P., & Batenburg, K. J. (2025) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.18675 · Cited by 75
Human-artificial interaction in the age of agentic AI: a system-theoretical approach
Borghoff, U. M., Bottoni, P., & Pareschi, R. (2025) · Frontiers in Human Dynamics · doi:10.3389/fhumd.2025.1579166 · Cited by 89
Bio-Inspired Collision Avoidance in Swarm Systems via Deep Reinforcement Learning
Na, S., Niu, H., Lennox, B., & Arvin, F. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3145346 · Cited by 64
Guo, B., Zhuang, Z., Pan, J.-S., & Chu, S.-C. (2021) · IEEE Access · doi:10.1109/access.2021.3049421 · Cited by 59
Human Activity Recognition Data Analysis: History, Evolutions, and New Trends
Ariza-Colpas, P. P., Vicario, E., Oviedo-Carrascal, A. I., Butt Aziz, S., Piñeres-Melo, M. A., Quintero-Linero, A., & Patara, F. (2022) · Sensors · doi:10.3390/s22093401 · Cited by 52
Statistical physics of liquid brains
Piñero, J., & Solé, R. (2019) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2018.0376 · Cited by 39
Textual Feature Extraction Using Ant Colony Optimization for Hate Speech Classification
Gite, S., Patil, S., Dharrao, D., Yadav, M., Basak, S., Rajendran, A., & Kotecha, K. (2023) · Big Data and Cognitive Computing · doi:10.3390/bdcc7010045 · Cited by 37
Lamy, J.-B., Berthelot, H., Capron, C., & Favre, M. (2017) · Journal of Visual Languages & Computing · doi:10.1016/j.jvlc.2017.09.003 · Cited by 24
A Review of Bio-Inspired Computing Methods and Potential Applications
Chakraborty, A., & Kar, A. K. (2016) · Lecture Notes in Electrical Engineering · doi:10.1007/978-81-322-3589-7_16 · Cited by 19
Metadata
- Authors
- Dorigo, M., Birattari, M., & Stutzle, T.
- Venue
- IEEE Computational Intelligence Magazine
- Published
- 2006-11
- Volume
- 1
- Issue
- 4
- Pages
- 28-39
- ISSN
- 1556-603X (ISSN-L)
- OpenAlex
- W1530490667
- Cited by
- 1,880
- References
- 5
- FWCI
- 47.07
- Type
- journal article
- Language
- en
- Open access
- green
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
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.
