Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization (E...
香港六合彩-六合彩
1. Natural Computation CO637 Swarm Intelligence III: Ant Colony Optimisation applications Comparing PSO and ACO Alex Freitas
2.
3.
4.
5. AntNet’s main data structure A pheromone matrix T associated with each node i of the network Each element ijd of T indicates the desirability for an ant in node i and with destination node d to move to node j i,1,1 . . . i,1,n i,N(i),1 . . . i,N(i),n destination nodes . . . . . . . . . Neighbour nodes Structure of transition matrix at node i : N(i) is the number of neighbours of node i n is the total number of nodes in the network
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18. References M. Dorigo and T. Stutzle. Ant Colony Optimization . MIT Press, 2004. N. Monmarche, M. Slimane, G. Venturini. AntClass: discovery of clusters in numeric data by an hybridization of an ant colony with the Kmeans algorithm. Internal Report No. 213 , E3i. Laboratoire d’Informatique. Universite de Tours, France. Jan. 1999. (URL: citeseer.ist.psu.edu/559169.html) D. Warner, J.N. Richter, S.D. Durbin and B. Banerjee. Mining user session data to facilitate user interaction with a customer service knowledge base in RightNow Web. Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD-2000) , pp. 467-472. ACM Press, 2001.