The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Ant colony optimization: a new meta-heuristic
Abstract
Recently, a number of algorithms inspired by the foraging behavior of ant colonies have been applied to the solution of difficult discrete optimization problems. We put these algorithms in a common framework by defining the Ant Colony Optimization (ACO) meta-heuristic. A couple of paradigmatic examples of applications of these novel meta-heuristic are given, as well as a brief overview of existing applications.
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 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-citation(1995) · Cited by 10,558
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-citationOptimization, Learning and Natural Algorithms
Dorigo, M. (1992) · Medical Entomology and Zoology · Cited by 3,307
Self-citationAnt Algorithms for Discrete Optimization
Dorigo, M., Caro, G. D., & Gambardella, L. M. (1999) · Artificial Life · doi:10.1162/106454699568728 · Cited by 2,808
Self-citationComputer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
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-citationA 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 793
The ant system applied to the quadratic assignment problem
Maniezzo, V., & Colorni, A. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.806935 · Cited by 744
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
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
Gambardella, L. M., Taillard, É. D., & Agazzi, G. (1999) · Cited by 725
The traveling salesman: computational solutions for TSP applications
Reinelt, G. (1994) · Cited by 720
Knowledge and data engineering
Ramamoorthy, C. V., & Wah, B. W.-S. (1989) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.43400 · Cited by 670
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5775-3 · Cited by 669
Ant system for Job-shop Scheduling
Colorni, A., Dorigo, M., Maniezzo, V., & Trubian, M. (1994) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 617
Self-citationCosta, D., & Hertz, A. (1997) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600357 · Cited by 497
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
ACO algorithms for the quadratic assignment problem
Stützle, T., & Dorigo, M. (1999) · Cited by 262
Self-citationA 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
Parallelization strategies for Ant Colony Optimization
Stützle, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0056914 · Cited by 175
Two Ant Colony Algorithms for Best-Effort Routing in Datagram Networks
Di, G. A., & Dorigo, M. (1998) · Cited by 137
Self-citationAn ant colony optimization approach for the single machine total tardiness problem
Bauer, A., Bullnheimer, B., Hartl, R. F., & Strauß, C. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.782653 · Cited by 129
An island model based ant system with lookahead for the shortest supersequence problem
Michel, R., & Middendorf, M. (1998) · Lecture notes in computer science · doi:10.1007/bfb0056911 · Cited by 123
The Max-Min ANT System and Local Search for Combinatorial Optimization Problems
Stützle, T., & Hoos, H. H. (1999) · Springer eBooks · doi:10.1007/978-1-4615-5775-3_22 · Cited by 120
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
Gambardella, L. M., & Dorigo, M. (1997) · doi:10.71910/supsi.7460 · Cited by 102
Self-citationAdaptive search heuristics for the generalized assignment problem
Ramalhinho, H., & Serra, D. (2002) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · Cited by 96
Adaptive approach heuristics for the generalized assignment problemPreprint
Ramalhinho, H., & Serra, D. (1998) · RePEc: Research Papers in Economics · Cited by 36
Cited by
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
Lourenço, H. R., Martin, O. C., & Stützle, T. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_11 · Cited by 1,164
Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems
Hashim, F. A., Hussain, K., Houssein, E. H., Mabrouk, M. S., & Al-Atabany, W. (2021) · Applied Intelligence · doi:10.1007/s10489-020-01893-z · Cited by 1,134
RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method
Ahmadianfar, I., Heidari, A. A., Gandomi, A. H., Chu, X., & Chen, H. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115079 · Cited by 1,115
Henry gas solubility optimization: A novel physics-based algorithm
Hashim, F. A., Houssein, E. H., Mabrouk, M. S., Al-Atabany, W., & Mirjalili, S. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.07.015 · Cited by 1,061
Metadata
- Authors
- Dorigo, M., & Di Caro, G.
- Venue
- Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)
- Publisher
- IEEE
- Published
- 2003-01-20
- Pages
- 1470-1477
- OpenAlex
- W2171211995
- Cited by
- 2,137
- References
- 27
- FWCI
- 42.72
- 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
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.