Professional Documents
Culture Documents
Swarms
Suppose ant k is at u.
Nk(u) be the nodes not visited by k
Tuv be the pheromone trail of edge (u,v)
k jumps from u to a node v in Nk(u) with
probability
puv(k) = Tuv ( 1/ d(u,v))
Iteration of AOC-TSP
Recruitment Behaviour :
Waggle Dancing
series of alternating left and right loops
Direction of dancing
Duration of dancing
Navigation Behaviour :
Path vector represents knowledge representation of
path by inspect
Construction of PI.
Algorithm
Swarmcasting:
For fast downloads in a peer-to-peer file-sharing
network
Fragments of a file are downloaded from different
hosts in the network, parallelly.
AntNet : a routing algorithm developed on the
framework of Ant Colony Optimization