Solving the mesh-partitioning problem with an ant-colony algorithm
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
A Comprehensive Overview of the Applications of Artificial Life
Artificial Life
An ant algorithm for balanced job scheduling in grids
Future Generation Computer Systems
A bottom-up approach to discover transition rules of cellular automata using ant intelligence
International Journal of Geographical Information Science
Swarm intelligence based energy saving and load balancing in wireless ad hoc networks
BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
Ant intelligence for solving optimal path-covering problems with multi-objectives
International Journal of Geographical Information Science
Energy saving and load balancing in wireless ad hoc networks through ant-based routing
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Evolutionary computation approaches to the Curriculum Sequencing problem
Natural Computing: an international journal
Bio-inspired multi-agent systems for reconfigurable manufacturing systems
Engineering Applications of Artificial Intelligence
Efficient dynamic routing on large road networks
SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
| Hi-index | 0.00 |
An ANT is a mobile agent that is capable of solvingvarious kinds of routing and congestion problems incomputer networking by continuously modifying routingtables in respond to congestion. In a distributed problemsolving paradigm, a society of ANTs (each contributingsome information) collaborate to solve a larger problem.In recent years, Ant-based algorithms were used to solveclassical routing problems such as: Traveling SalesmanProblem, Vehicle Routing Problem, Quadratic AssignmentProblem, connection-oriented /connectionless routing,sequential ordering, graph coloring and shortest commonsupersequence. This paper introduces the general idea ofAnt-based algorithms with a focus on Ant ColonyOptimization (ACO), and their features, strengths,weaknesses and applications in network routing. Thecontribution of this paper is the proposal of a multipleant-colony optimization (MACO) approach for networkrouting.