The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A short convergence proof for a class of ant colony optimization algorithms
Abstract
We prove some convergence properties for a class of ant colony optimization algorithms. In particular, we prove that for any small constant /spl epsiv/ > 0 and for a sufficiently large number of algorithm iterations t, the probability of finding an optimal solution at least once is P*(t) /spl ges/ 1 - /spl epsiv/ and that this probability tends to 1 for t/spl rarr//spl infin/. We also prove that, after an optimal solution has been found, it takes a finite number of iterations for the pheromone trails associated to the found optimal solution to grow higher than any other pheromone trail and that, for t/spl rarr//spl infin/, any fixed ant will produce the optimal solution during the tth iteration with probability P /spl ges/ 1 /spl epsiv//spl circ/(/spl tau//sub min/, /spl tau//sub max/), where /spl tau//sub min/ and /spl tau//sub max/ are the minimum and maximum values that can be taken by pheromone trails.
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 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-citationAnt 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-citationHoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
Ant colony optimization: a new meta-heuristic
Dorigo, M., & Di Caro, G. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.782657 · Cited by 2,137
Self-citationThe Ant Colony Optimization Metaheuristic
(2004) · Ant Colony Optimization · doi:10.7551/mitpress/1290.003.0004 · Cited by 1,406
Cooling Schedules for Optimal Annealing
Hajek, B. (1988) · Mathematics of Operations Research · doi:10.1287/moor.13.2.311 · Cited by 1,246
Grassé, P.-P. (1959) · Insectes Sociaux · doi:10.1007/bf02223791 · Cited by 1,236
The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
Dorigo, M., & Stützle, T. (2003) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_9 · Cited by 864
Self-citation
Cited by
Ant colony optimization theory: A survey
Dorigo, M., & Blum, C. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.05.020 · Cited by 2,295
Self-citationAnt 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
The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
Dorigo, M., & Stützle, T. (2003) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_9 · Cited by 864
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-citationAnt 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-citationEvolutionary 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
A novel decentralized platform for peer-to-peer energy trading market with blockchain technology
Esmat, A., de Vos, M., Ghiassi-Farrokhfal, Y., Palensky, P., & Epema, D. (2021) · Applied Energy · doi:10.1016/j.apenergy.2020.116123 · Cited by 420
Maniezzo, V., Gambardella, L. M., & de Luigi, F. (2004) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-39930-8_5 · Cited by 403
Metadata
- Authors
- Stutzle, T., & Dorigo, M.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2002-08
- Volume
- 6
- Issue
- 4
- Pages
- 358-365
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2130411910
- Cited by
- 427
- References
- 16
- FWCI
- 8.36
- Type
- journal article
- 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.