The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
Ant colony optimization theory: A survey
Open accessAbstract
Research on a new metaheuristic for optimization is often initially focused on proof-of-concept applications. It is only after experimental work has shown the practical interest of the method that researchers try to deepen their understanding of the method's functioning not only through more and more sophisticated experiments but also by means of an effort to build a theory. Tackling questions such as "how and why the method works" is important, because finding an answer may help in improving its applicability. Ant colony optimization, which was introduced in the early 1990s as a novel technique for solving hard combinatorial optimization problems, finds itself currently at this point of its life cycle. With this article we provide a survey on theoretical results on ant colony optimization. First, we review some convergence results. Then we discuss relations between ant colony optimization algorithms and other approximate methods for optimization. Finally, we focus on some research efforts directed at gaining a deeper understanding of the behavior of ant colony optimization algorithms. Throughout the paper we identify some open questions with a certain interest of being solved in the near future.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
Self-citationA Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
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-citationInformation theory and statistics
(1959) · Journal of the Franklin Institute · doi:10.1016/0016-0032(59)90368-0 · Cited by 7,094
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Research works printed but not linked: 10
- C. Blum, M. Dorigo, Deception in ant colony optimization, in: M. Dorigo, M. Birattari, C. Blum, L.M. Gambardella, F. Mondada, T. Stützle (Eds.), Proc. ANTS 2004, Fourth Internat. Workshop on Ant Colony Optimization and Swarm Intelligence, Lecture Notes in Computer Science, Vol. 3172, Springer, Berlin, Germany, 2004, pp. 119–130. · doi:10.1007/978-3-540-28646-2_11
- Blum, 2002, Ant Colony Optimization for FOP shop scheduling: a case study on different pheromone representations, Vol. 2, 1558
- C. Blum, M. Sampels, When model bias is stronger than selection pressure, in: J.J. Merelo Guervós et al. (Eds.), Proc. PPSN-VII, Seventh Internat. Conf. on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Vol. 2439, Springer, Berlin, Germany, 2002, pp. 893–902. · doi:10.1007/3-540-45712-7_86
- Blum, 2004, An ant colony optimization algorithm for shop scheduling problems, J. Math. Model. Algorithms, 3, 285, 10.1023/B:JMMA.0000038614.39977.6f · doi:10.1023/b:jmma.0000038614.39977.6f
- Gagné, 2002, Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times, J. Oper. Res. Soc., 53, 895, 10.1057/palgrave.jors.2601390 · doi:10.1057/palgrave.jors.2601390
- Gutjahr, 2002, ACO algorithms with guaranteed convergence to the optimal solution, Inform. Process. Lett., 82, 145, 10.1016/S0020-0190(01)00258-7 · doi:10.1016/s0020-0190(01)00258-7
- D. Merkle, M. Middendorf, Modelling ACO: composed permutation problems, in: M. Dorigo, G. Di Caro, M. Sampels (Eds.), Ant Algorithms, Proc. ANTS 2002, Third Internat. Workshop, Lecture Notes in Computer Science, Vol. 2463, Springer, Berlin, Germany, 2002, pp. 149–162.
- Merkle, 2002, Modelling the dynamics of ant colony optimization algorithms, Evol. Comput., 10, 235, 10.1162/106365602760234090 · doi:10.1162/106365602760234090
- D. Merkle, M. Middendorf, Competition controlled pheromone update for ant colony optimization, in: M. Dorigo, M. Birattari, C. Blum, L.M. Gambardella, F. Mondada, T. Stützle (Eds.), Proc. ANTS 2004, Fourth Internat. Workshop on Ant Colony Optimization and Swarm Intelligence, Lecture Notes in Computer Science, Vol. 3172, Springer, Berlin, Germany, 2004, pp. 95–105. · doi:10.1007/978-3-540-28646-2_9
- Prügel-Bennett, 2001, Modelling genetic algorithm dynamics, 59, 10.1007/978-3-662-04448-3_4 · doi:10.1007/978-3-662-04448-3_4
Cited by
Slime mould algorithm: A new method for stochastic optimization
Li, S., Chen, H., Wang, M., Heidari, A. A., & Mirjalili, S. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.03.055 · Cited by 3,036
Atashpaz-Gargari, E., & Lucas, C. (2007) · 2007 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2007.4425083 · Cited by 2,628
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
A survey on optimization metaheuristics
Boussaïd, I., Lepagnot, J., & Siarry, P. (2013) · Information Sciences · doi:10.1016/j.ins.2013.02.041 · Cited by 1,655
Black hole: A new heuristic optimization approach for data clustering
Hatamlou, A. (2013) · Information Sciences · doi:10.1016/j.ins.2012.08.023 · Cited by 1,370
Ant colony optimization: Introduction and recent trends
Blum, C. (2005) · Physics of Life Reviews · doi:10.1016/j.plrev.2005.10.001 · Cited by 1,308
Self-citationRajabioun, R. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2011.05.008 · Cited by 1,148
Yang, Y., Chen, H., Heidari, A. A., & Gandomi, A. H. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114864 · Cited by 1,062
A Competitive Swarm Optimizer for Large Scale Optimization
Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2322602 · Cited by 1,052
“update of Xl(t), which is an inevitable operation in most swarm or population based evolutionary algorithms [2], [46]–[48].”
BackgroundTang, J., Liu, G., & Pan, Q. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1004129 · Cited by 996
A survey on new generation metaheuristic algorithms
Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.106040 · Cited by 923
Support vector machine applications in the field of hydrology: A review
Raghavendra. N, S., & Deka, P. C. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2014.02.002 · Cited by 780
Search-based software engineering: Trends, techniques and applications
Harman, M., Mansouri, S. A., & Zhang, Y. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379787 · Cited by 777
A social learning particle swarm optimization algorithm for scalable optimization
Cheng, R., & Jin, Y. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.039 · Cited by 747
“Behavior learning is an essential and common process for updating particle behaviors, which is also similar to other learning mechanisms in various swarm intelligence algorithms [18,40,43,59].”
BackgroundA survey on metaheuristics for stochastic combinatorial optimization
Bianchi, L., Dorigo, M., Gambardella, L. M., & Gutjahr, W. J. (2009) · Natural Computing · doi:10.1007/s11047-008-9098-4 · Cited by 737
Self-citationAnt Colony Optimization: Overview and Recent Advances
Dorigo, M., & Stützle, T. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_10 · Cited by 722
Self-citationA survey: algorithms simulating bee swarm intelligence
Karaboga, D., & Akay, B. (2009) · Artificial Intelligence Review · doi:10.1007/s10462-009-9127-4 · Cited by 646
The Current State and Future of Search Based Software Engineering
Harman, M. (2007) · Future of Software Engineering (FOSE '07) · doi:10.1109/fose.2007.29 · Cited by 631
Ant Colony Optimization: Overview and Recent Advances
Dorigo, M., & Stützle, T. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_8 · Cited by 579
Self-citationBio 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
A survey on nature inspired metaheuristic algorithms for partitional clustering
Nanda, S. J., & Panda, G. (2014) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2013.11.003 · Cited by 574
Dandelion Optimizer: A nature-inspired metaheuristic algorithm for engineering applications
Zhao, S., Zhang, T., Ma, S., & Chen, M. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105075 · Cited by 492
Harmony Search as a Metaheuristic Algorithm
Yang, X.-S. (2009) · Studies in Computational Intelligence · doi:10.1007/978-3-642-00185-7_1 · Cited by 487
Razavi Termeh, S. V., Kornejady, A., Pourghasemi, H. R., & Keesstra, S. (2018) · Science of The Total Environment · doi:10.1016/j.scitotenv.2017.09.262 · Cited by 472
Simulation optimization: a review of algorithms and applications
Amaran, S., Sahinidis, N. V., Sharda, B., & Bury, S. J. (2016) · Annals of Operations Research · doi:10.1007/s10479-015-2019-x · Cited by 467
Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A. M., & Talbi, E.-G. (2022) · European Journal of Operational Research · doi:10.1016/j.ejor.2021.04.032 · Cited by 462
Swarm Intelligence: A Review of Algorithms
Chakraborty, A., & Kar, A. K. (2017) · Modeling and Optimization in Science and Technologies · doi:10.1007/978-3-319-50920-4_19 · Cited by 447
Evolutionary optimization as applied to inverse scattering problems
Rocca, P., Benedetti, M., Donelli, M., Franceschini, D., & Massa, A. (2009) · Inverse Problems · doi:10.1088/0266-5611/25/12/123003 · Cited by 441
Cloud Task Scheduling Based on Load Balancing Ant Colony Optimization
Li, K., Xu, G., Zhao, G., Dong, Y., & Wang, D. (2011) · 2011 Sixth Annual Chinagrid Conference · doi:10.1109/chinagrid.2011.17 · Cited by 408
Kefayat, M., Lashkar Ara, A., & Nabavi Niaki, S. A. (2015) · Energy Conversion and Management · doi:10.1016/j.enconman.2014.12.037 · Cited by 401
Swarm Intelligence in Optimization
Blum, C., & Li, X. (2008) · Natural Computing Series · doi:10.1007/978-3-540-74089-6_2 · Cited by 396
Self-citationText feature selection using ant colony optimization
Aghdam, M. H., Ghasem-Aghaee, N., & Basiri, M. E. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.08.022 · Cited by 389
Particle swarm and ant colony algorithms hybridized for improved continuous optimization
Shelokar, P. S., Siarry, P., Jayaraman, V. K., & Kulkarni, B. D. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.09.098 · Cited by 344
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
Cloud task scheduling based on ant colony optimization
Tawfeek, M. A., El-Sisi, A., Keshk, A. E., & Torkey, F. A. (2013) · 2013 8th International Conference on Computer Engineering & Systems (ICCES) · doi:10.1109/icces.2013.6707172 · Cited by 303
Planetary gearbox fault diagnosis using an adaptive stochastic resonance method
Lei, Y., Han, D., Lin, J., & He, Z. (2013) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2012.06.021 · Cited by 299
Fundamentals of natural computing: an overview
DECASTRO, L. (2007) · Physics of Life Reviews · doi:10.1016/j.plrev.2006.10.002 · Cited by 297
Technological revolutions in smart farming: Current trends, challenges & future directions
Sharma, V., Tripathi, A. K., & Mittal, H. (2022) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2022.107217 · Cited by 297
Tang, J., Duan, H., & Lao, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10281-7 · Cited by 284
A Survey of Artificial Intelligence for Cognitive Radios
He, A., Bae, K. K., Newman, T. R., Gaeddert, J., Kim, K., Menon, R., Morales-Tirado, L., Neel, J. J., Zhao, Y., Reed, J. H., et al. (2010) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2010.2043968 · Cited by 279
Yusup, N., Zain, A. M., & Hashim, S. Z. M. (2012) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.02.109 · Cited by 265
Zhang, Z., Long, K., Wang, J., & Dressler, F. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.062613.00014 · Cited by 262
Recent advances in engineering design optimisation: Challenges and future trends
Roy, R., Hinduja, S., & Teti, R. (2008) · CIRP Annals · doi:10.1016/j.cirp.2008.09.007 · Cited by 248
Zubo, R. H. A., Mokryani, G., Rajamani, H.-S., Aghaei, J., Niknam, T., & Pillai, P. (2017) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2016.10.036 · Cited by 218
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
Embedded Intelligence on FPGA: Survey, Applications and Challenges
Seng, K. P., Lee, P. J., & Ang, L. M. (2021) · Electronics · doi:10.3390/electronics10080895 · Cited by 105
“For the ACO method, a graph is used to represent the solution space [49].”
MethodFang, C., Liu, X., Pardalos, P. M., & Pei, J. (2016) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-015-7593-1 · Cited by 102
“From the solution aspect, many searching algorithms have been shown to be effective and efficient in dealing with different optimization problems, such as genetic algorithm [70], ant colony algorithm [71], simulated annealing algorithm [72], and particle swarm optimization (PSO) algorithm [73], etc.”
MethodOptimizing Virtual Machine placement in IaaS data centers: Taxonomy, review and open issues
Talebian, H., Gani, A., Sookhak, M., Abdelatif, A. A., Yousafzai, A., Vasilakos, A. V., & Yu, F. R. (2020) · Cluster Computing · doi:10.1007/s10586-019-02954-w · Cited by 72
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
Li, D., Huang, L., Wang, K., Pang, W., Zhou, Y., & Zhang, R. (2018) · IEEE Access · doi:10.1109/access.2018.2882455 · Cited by 11
Metadata
- Authors
- Dorigo, M., & Blum, C.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2005-11
- Volume
- 344
- Issue
- 2-3
- Pages
- 243-278
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2118573797
- Cited by
- 2,295
- References
- 63
- FWCI
- 51.87
- Type
- journal article
- Language
- en
- Open access
- bronze
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 2851 d)
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.