Reconfigurable network based on ant algorithms

The social inset colony metaphor has provided computer scientists with powerful new models with which problems can be attached by means of swarm intelligence. The focus of this paper is on reviewing the idea behind ant algorithm and its application to determine the shortest path between two nodes in a reconfigurable network. The ants move across the network between arbitrary pairs of nodes selecting their path at each intermediate node according to the distribution of simulated pheromones at each node. As they move they deposit simulated pheromones as function of their congestion encountered on their journey.