The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Ant colony optimization for routing and load-balancing: survey and new directions
Abstract
Although an ant is a simple creature, collectively a colony of ants performs useful tasks such as finding the shortest path to a food source and sharing this information with other ants by depositing pheromone. In the field of ant colony optimization (ACO), models of collective intelligence of ants are transformed into useful optimization techniques that find applications in computer networking. In this survey, the problem-solving paradigm of ACO is explicated and compared to traditional routing algorithms along the issues of routing information, routing overhead and adaptivity. The contributions of this survey include 1) providing a comparison and critique of the state-of-the-art approaches for mitigating stagnation (a major problem in many ACO algorithms), 2) surveying and comparing three major research in applying ACO in routing and load-balancing, and 3) discussing new directions and identifying open problems. The approaches for mitigating stagnation discussed include: evaporation, aging, pheromone smoothing and limiting, privileged pheromone laying and pheromone-heuristic control. The survey on ACO in routing/load-balancing includes comparison and critique of ant-based control and its ramifications, AntNet and its extensions, as well as ASGA and SynthECA. Discussions on new directions include an ongoing work of the authors in applying multiple ant colony optimization in load-balancing.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
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
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 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
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
The Ant Colony Optimization Metaheuristic
(2004) · Ant Colony Optimization · doi:10.7551/mitpress/1290.003.0004 · Cited by 1,406
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
Inspiration for optimization from social insect behaviour
Bonabeau, E., Dorigo, M., & Theraulaz, G. (2000) · Nature · doi:10.1038/35017500 · Cited by 912
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
Dorigo, M., Bonabeau, E., & Theraulaz, G. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(00)00042-x · Cited by 816
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 793
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
Trails and U-turns in the selection of a path by the ant Lasius niger
Beckers, R., Deneubourg, J. L., & Goss, S. (1992) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(05)80686-1 · Cited by 434
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
AntNet: A Mobile Agents Approach to Adaptive Routing
Di, G. A. (1999) · Cited by 285
Ant-like agents for load balancing in telecommunications networks
Schoonderwoerd, R., Holland, O., & Bruten, J. (1997) · Proceedings of the first international conference on Autonomous agents - AGENTS '97 · doi:10.1145/267658.267718 · Cited by 275
Ants and reinforcement learning: a case study in routing in dynamic networks
Subramanian, D., Druschel, P., & Chen, J. (1997) · Cited by 227
Mobile agents for adaptive routing
Di Caro, G., & Dorigo, M. (2002) · Proceedings of the Thirty-First Hawaii International Conference on System Sciences · doi:10.1109/hicss.1998.649179 · Cited by 213
Ant colonies for adaptive routing in packet-switched communications networks
Di Caro, G., & Dorigo, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0056909 · Cited by 163
Two Ant Colony Algorithms for Best-Effort Routing in Datagram Networks
Di, G. A., & Dorigo, M. (1998) · Cited by 137
Mobile Software Agents for Control in Telecommunications Networks
Appleby, S., & Steward, S. (2000) · BT Technology Journal · doi:10.1023/a:1026569720098 · Cited by 132
Routing in telecommunications networks with ant-like agents
Bonabeau, E. W., Hénaux, F., Guérin, S., Snyers, D., Kuntz, P., & Guy Theraulaz, A. (1998) · Lecture notes in computer science · doi:10.1007/bfb0053944 · Cited by 132
Ant Colony Optimization: An Overview
Maniezzo, V., & Carbonaro, A. (2002) · Operations research, computer science. Interface series · doi:10.1007/978-1-4615-1507-4_21 · Cited by 129
Towards multi-swarm problem solving in networks
White, T., & Pagurek, B. (2002) · International Conference on Multi Agent Systems · doi:10.1109/icmas.1998.699217 · Cited by 118
Adaptive Agent-Driven Routing and Load Balancing in Communication Networks
Heusse, M., Snyers, D., Guérin, S., & Kuntz, P. (1998) · Advances in Complex Systems · doi:10.1142/s0219525998000168 · Cited by 114
Routing in Telecommunications Networks with ``Smart'' Ant-Like AgentsPreprint
Bonabeau, E. W., Hénaux, F., 'erin, S. G., Snyers, D., Kuntz, P., & Guy Theraulaz, A. (1998) · RePEc: Research Papers in Economics · Cited by 104
A new approach for AntNet routing
Barán, B., & Sosa, R. (2002) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn.2000.885506 · Cited by 99
Multiple ant-colony optimization for network routing
Sim, K. M., & Sun, W. H. (2003) · International Conference on Cyberworlds (CW) · doi:10.1109/cw.2002.1180890 · Cited by 87
Self-citationAnt colony optimisation for virtual-wavelength-path routing and wavelength allocation
Varela, G. N., & Sinclair, M. C. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.785494 · Cited by 86
An adaptive multi-agent routing algorithm inspired by ants behavior
Di, G. A., Dorigo, M., Hawick, K. A., & James, H. (1998) · Cited by 56
ANTS: Agents on Networks, Trees, and Subgraphs
Wagner, I. A., Lindenbaum, M., & Bruckstein, A. M. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(00)00045-5 · Cited by 41
Distributed Fault Location in Networks Using Learning Mobile Agents
White, T., & Pagurek, B. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46693-2_14 · Cited by 21
Multiple Ant Colony Optimization for Load Balancing
Sim, K. M., & Sun, W. H. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45080-1_64 · Cited by 17
Self-citationMinimal Agents for Communications Network Routing: The Social Insect Paradigm
Schoonderwoerd, R., & Holland, O. E. (1999) · Springer eBooks · doi:10.1007/978-3-642-58418-3_13 · Cited by 11
A COMPARATIVE STUDY OF ANT-BASED OPTIMIZATION FOR DYNAMIC ROUTING
Sim, K. M., & Sun, W. H. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45336-9_19 · Cited by 9
Self-citationCollective Intelligence and Priority Routing in Networks
White, T., Pagurek, B., & Deugo, D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-48035-8_76 · Cited by 4
Cited by
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
Dorigo, M., Birattari, M., & Stutzle, T. (2006) · IEEE Computational Intelligence Magazine · doi:10.1109/ci-m.2006.248054 · Cited by 1,880
Tang, J., Liu, G., & Pan, Q. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1004129 · Cited by 996
Ant 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
Computational Intelligence in Wireless Sensor Networks: A Survey
Kulkarni, R. V., Forster, A., & Venayagamoorthy, G. K. (2011) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.040310.00002 · Cited by 695
Metadata
- Authors
- Sim, K. M., & Sun, W. H.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Published
- 2003-09
- Volume
- 33
- Issue
- 5
- Pages
- 560-572
- ISSN
- 1083-4427 (ISSN-L)
- OpenAlex
- W2146354236
- Cited by
- 506
- References
- 39
- FWCI
- 15.90
- 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.