A Heuristic Ant Algorithm for Solving QoS Multicast Routing Problem. Chao-Hsien Chu; JunHua Gu; Xiang Dan Hou; Qijun Gu Congress on Evolutionary Computation Proceedings of the 2002. Outline. Introduction Ant Colony Behaviors QoS Multicast Routing Model Ant Algorithm Result and Analysis
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Chao-Hsien Chu; JunHua Gu; Xiang Dan Hou; Qijun Gu
Congress on Evolutionary Computation
Proceedings of the 2002
Put the values of source node into tabuk(s);
/* Tabu is used to save the nodes that were reached before t. tabuk(s) denotes the s-th node visited by the k-th ant in the current route and s is the index of tabu table. */
Choose a node j according to the probability：
For every edge(i,j)
For k:=1 to m
empty all tabu; goto step 2.
output the minimum cost path until all nodes have been passed.
B=70,D=46, DJ=8, PL=0.001
Performance of Ant Algorithm
Performance of Genetic Algorithm
Scalability of ant algorithm – 16 nodes
Scalability of ant algorithm – 20 nodes