Ant Colony Optimization
The DOI matches its Crossref record; 68 of the 68 references it cites were found in a registry or an index.
Abstract
This chapter presents an overview of ant colony optimization (ACO)—a metaheuristic inspired by the behavior of real ants. Ant colony optimization was proposed by Dorigo and colleagues [1-3] as a method for solving hard combinatorial optimization problems (COPs).
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
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
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
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
Ant Algorithms for Discrete Optimization
Dorigo, M., Caro, G. D., & Gambardella, L. M. (1999) · Artificial Life · doi:10.1162/106454699568728 · Cited by 2,808
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
Ant colonies for the travelling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · Biosystems · doi:10.1016/s0303-2647(97)01708-5 · Cited by 2,023
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 · cited 1×
“Se han planteado variantes que incorporan este tipo de mecanismos para abordar tanto problemas estático como dinámicos [16, 17, 18, 19, 20].”
BackgroundGrassé, P.-P. (1959) · Insectes Sociaux · doi:10.1007/bf02223791 · Cited by 1,236
A new rank based version of the Ant System. A computational study.
Bullnheimer, B., Hartl, R. F., & Strauß, C. (1997) · ePubWU Institutional Repository (Wirtschaftsuniversität Wien) · doi:10.57938/2eb99227-a596-4eb4-bb7d-367b53dee89d · Cited by 1,003
Data mining with an ant colony optimization algorithm
Parpinelli, R. S., Lopes, H. S., & Freitas, A. A. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802452 · Cited by 985
The self-organizing exploratory pattern of the argentine ant
Deneubourg, J. L., Aron, S., Goss, S., & Pasteels, J. M. (1990) · Journal of Insect Behavior · doi:10.1007/bf01417909 · Cited by 921
Self-organized shortcuts in the Argentine ant
Goss, S., Aron, S., Deneubourg, J. L., & Pasteels, J. M. (1989) · Naturwissenschaften · doi:10.1007/bf00462870 · Cited by 919
The Dynamics of Collective Sorting: Robot-Like Ants and Ant-Like Robots
Deneubourg, J. L., Goss, S., Franks, N., Sendova-Franks, A., Detrain, C., & Chrétien, L. (1991) · From Animals to Animats · doi:10.7551/mitpress/3115.003.0048 · Cited by 889
Regulation Of Division Of Labor In Insect Societies
Robinson, G. E. (1992) · Annual Review of Entomology · doi:10.1146/annurev.ento.37.1.637 · Cited by 886
MAX-MIN Ant System and local search for the traveling salesman problem
Stutzle, T., & Hoos, H. (2002) · Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) · doi:10.1109/icec.1997.592327 · Cited by 831
Ant colony optimization for resource-constrained project scheduling
Merkle, D., Middendorf, M., & Schmeck, H. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802450 · Cited by 759
Ant-Based Load Balancing in Telecommunications Networks
Schoonderwoerd, R., Holland, O. E., Bruten, J. L., & Rothkrantz, L. J. M. (1997) · Adaptive Behavior · doi:10.1177/105971239700500203 · Cited by 739
Ant-Q: A Reinforcement Learning approach to the traveling salesman problem
Gambardella, L. M., & Dorigo, M. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50039-6 · Cited by 605
AntHocNet: an adaptive nature‐inspired algorithm for routing in mobile ad hoc networks
Di Caro, G., Ducatelle, F., & Gambardella, L. M. (2005) · European Transactions on Telecommunications · doi:10.1002/ett.1062 · Cited by 579
Diversity and Adaptation in Populations of Clustering Ants
Lumer, E. D., & Faieta, B. (1994) · From Animals to Animats 3 · doi:10.7551/mitpress/3117.003.0071 · Cited by 575
Ant colony optimization for routing and load-balancing: survey and new directions
Sim, K. M., & Sun, W. H. (2003) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2003.817391 · Cited by 506
Solving symmetric and asymmetric TSPs by ant colonies
Gambardella, L. M., & Dorigo, M. (2002) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542672 · Cited by 506
Costa, D., & Hertz, A. (1997) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600357 · Cited by 497
The Hyper-Cube Framework for Ant Colony Optimization
Blum, C., & Dorigo, M. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2003.821450 · Cited by 432
A short convergence proof for a class of ant colony optimization algorithms
Stutzle, T., & Dorigo, M. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802444 · Cited by 427
Blum, C. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2003.11.018 · Cited by 421
Ant Colony System for a Dynamic Vehicle Routing Problem
Montemanni, R., Gambardella, L. M., Rizzoli, A. E., & Donati, A. V. (2005) · Journal of Combinatorial Optimization · doi:10.1007/s10878-005-4922-6 · Cited by 414
D-Ants: Savings Based Ants divide and conquer the vehicle routing problem
Reimann, M., Doerner, K., & Hartl, R. F. (2004) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00014-5 · Cited by 387
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
Gambardella, L. M., & Dorigo, M. (2000) · INFORMS Journal on Computing · doi:10.1287/ijoc.12.3.237.12636 · Cited by 373
A Graph-based Ant System and its convergence
Gutjahr, W. J. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(00)00044-3 · Cited by 368
Evolving Self-Organizing Behaviors for a Swarm-Bot
Dorigo, M., Trianni, V., Şahin, E., Groß, R., Labella, T. H., Baldassarre, G., Nolfi, S., Deneubourg, J.-L., Mondada, F., Floreano, D., et al. (2004) · Autonomous Robots · doi:10.1023/b:auro.0000033973.24945.f3 · Cited by 345
Collective Robotics: From Social Insects to Robots
Kube, C. R., & Zhang, H. (1993) · Adaptive Behavior · doi:10.1177/105971239300200204 · Cited by 338
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
Maniezzo, V. (1999) · INFORMS journal on computing · doi:10.1287/ijoc.11.4.358 · Cited by 338
An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem
Shmygelska, A., & Hoos, H. H. (2005) · BMC Bioinformatics · doi:10.1186/1471-2105-6-30 · Cited by 260
Model-Based Search for Combinatorial Optimization: A Critical Survey
Zlochin, M., Birattari, M., Meuleau, N., & Dorigo, M. (2004) · Annals of Operations Research · doi:10.1023/b:anor.0000039526.52305.af · Cited by 247
On how Pachycondyla apicalis ants suggest a new search algorithm
Monmarché, N., Venturini, G., & Slimane, M. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(00)00047-9 · Cited by 227
Ant Colony Optimization for the Total Weighted Tardiness Problem
den Besten, M., Stützle, T., & Dorigo, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_60 · Cited by 219
A new version of ant system for subset problems
Leguizamon, G., & Michalewicz, Z. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.782655 · Cited by 215
Self-organization mechanisms in ant societies. I: Trail recruitment to newly discovered food sources
Pasteéls, J. M., Deneubourg, J., & Goss, S. (1987) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 209
Ant-Based Clustering and Topographic Mapping
Handl, J., Knowles, J., & Dorigo, M. (2006) · Artificial Life · doi:10.1162/106454606775186400 · Cited by 207
ACO for Continuous and Mixed-Variable Optimization
Socha, K. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28646-2_3 · Cited by 199
A Population Based Approach for ACO
Guntsch, M., & Middendorf, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46004-7_8 · Cited by 198
Ants can solve constraint satisfaction problems
Solnon, C. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802449 · Cited by 196
Ant colony optimization for learning Bayesian networks
de Campos, L. M., Fernández-Luna, J. M., Gámez, J. A., & Puerta, J. M. (2002) · International Journal of Approximate Reasoning · doi:10.1016/s0888-613x(02)00091-9 · Cited by 194
Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP
Guntsch, M., & Middendorf, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45365-2_22 · Cited by 177
Parallelization strategies for Ant Colony Optimization
Stützle, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0056914 · Cited by 175
Gravel, M., Price, W. L., & Gagné, C. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(01)00329-0 · Cited by 169
Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art
Socha, K., Sampels, M., & Manfrin, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36605-9_31 · Cited by 167
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
Doerner, K. F., Gutjahr, W. J., Hartl, R. F., Strauss, C., & Stummer, C. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.09.009 · Cited by 166
An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem
Bianchi, L., Gambardella, L. M., & Dorigo, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45712-7_85 · Cited by 157
Dynamic Scheduling and Division of Labor in Social Insects
Campos, M., Bonabeau, E. W., Guy Theraulaz, A., & Deneubourg, J. (2000) · Adaptive Behavior · doi:10.1177/105971230000800201 · Cited by 129
A Comparison Between ACO Algorithms for the Set Covering Problem
Lessing, L., Dumitrescu, I., & Stützle, T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28646-2_1 · Cited by 117
USING ANT AGENTS TO COMBINE REACTIVE AND PROACTIVE STRATEGIES FOR ROUTING IN MOBILE AD-HOC NETWORKS
Ducatelle, F., Di, G. A., & Gambardella, L. M. (2005) · International Journal of Computational Intelligence and Applications · doi:10.1142/s1469026805001556 · Cited by 113
Ant Colony Optimization and Stochastic Gradient Descent
Meuleau, N., & Dorigo, M. (2002) · Artificial Life · doi:10.1162/106454602320184202 · Cited by 98
Ant Colony Optimization with Global Pheromone Evaluation for Scheduling a Single Machine
Merkle, D., & Middendorf, M. (2003) · Applied Intelligence · doi:10.1023/a:1020999407672 · Cited by 93
New metaheuristic approaches for the edge-weighted k-cardinality tree problem
Blum, C., & Blesa, M. J. (2003) · Computers & Operations Research · doi:10.1016/j.cor.2003.11.007 · Cited by 90
Ant colony control for autonomous decentralized shop floor routing
Cicirello, V. A., & Smith, S. F. (2002) · International Symposium on Autonomous Decentralized Systems · doi:10.1109/isads.2001.917443 · Cited by 75
Ant Algorithms for Assembly Line Balancing
Valhondo, J. B., & Pereira, J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45724-0_6 · Cited by 74
Searching for Maximum Cliques with Ant Colony Optimization
Fenet, S., & Solnon, C. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36605-9_22 · Cited by 74
Kuntz, P., Snyers, D., & Layzell, P. (1999) · Journal of Heuristics · doi:10.1023/a:1009665701840 · Cited by 70
Toward the Formal Foundation of Ant Programming
Birattari, M., Di, G. A., & Dorigo, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45724-0_16 · Cited by 63
Ant Systems for a Dynamic TSP - Ants Caught in a Traffic Jam
Eyckelhof, C. J., & Snoek, M. (2002) · Cited by 60
Solving permutation constraint satisfaction problems with Artificial Ants
Solnon, C. (2000) · Cited by 57
An Insect-Based Algorithm for the Dynamic Task Allocation Problem
Shervin Nouyan, A., Ghizzioli, R., Birattari, M., & Dorigo, M. (2005) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 32
Agent-Based Approach to Dynamic Task Allocation
Shervin Nouyan, A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45724-0_3 · Cited by 31
Probabilistic Modelling of a Bio-Inspired Collective Experiment with Real Robots
Martinoli, A., & Mondada, F. (1998) · Springer eBooks · doi:10.1007/978-3-642-72198-4_28 · Cited by 21
Cited by
Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2013.12.007 · Cited by 19,343
The Whale Optimization Algorithm
Mirjalili, S., & Lewis, A. (2016) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2016.01.008 · Cited by 14,581
Rao, R. V., Savsani, V. J., & Vakharia, D. P. (2011) · Computer-Aided Design · doi:10.1016/j.cad.2010.12.015 · Cited by 5,150
Multi-Verse Optimizer: a nature-inspired algorithm for global optimization
Mirjalili, S., Mirjalili, S. M., & Hatamlou, A. (2016) · Neural Computing and Applications · doi:10.1007/s00521-015-1870-7 · Cited by 2,925
Firefly algorithm, stochastic test functions and design optimisation
Yang, X. S. (2010) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2010.032124 · Cited by 2,729
Metadata
- Venue
- Handbook of Approximation Algorithms and Metaheuristics
- Publisher
- Chapman and Hall/CRC
- Published
- 2007-05-15
- Pages
- 417-430
- OpenAlex
- W1573676079
- Cited by
- 6,607
- References
- 68
- FWCI
- 689.44
- Type
- book chapter
- 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
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.