Ant-based load balancing in telecommunications networks
Adaptive Behavior
Ant-like agents for load balancing in telecommunications networks
AGENTS '97 Proceedings of the first international conference on Autonomous agents
Routing in telecommunications networks with ant-like agents
IATA '98 Proceedings of the second international workshop on Intelligent agents for telecommunication applications
The ant colony optimization meta-heuristic
New ideas in optimization
Ant algorithms for discrete optimization
Artificial Life
Future Generation Computer Systems
Ants: agents on networks, trees, and subgraphs
Future Generation Computer Systems
Efficiently searching a graph by a smell-oriented vertex process
Annals of Mathematics and Artificial Intelligence
Mobile Agents for Adaptive Routing
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A hybrid approach for feature subset selection using neural networks and ant colony optimization
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
An ANT is a mobile agent that is capable of solving various kinds of routing and congestion problems in computer networking by continuously modifying routing tables in respond to congestion. In a distributed problem solving paradigm, a society of ANTs (each contributing some information) collaborate to solve a larger problem. In recent years, Ant-based algorithms were used to solve classical routing problems such as: Travelling Salesman Problem, Vehicle Routing Problem, Quadratic Assignment Problem, connection-oriented/connectionless routing, sequential ordering, graph coloring and shortest common supersequence. By introducing the general idea of Ant-based algorithms with a focus on Ant Colony Optimization (ACO) and their mathematical models, this paper brings together a collection of ACO algorithms discussed their features, strength and weaknesses.