Ant colony optimization for multicast routing

IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings

Volumn , Issue , 2000, Pages 54-57

  Wang, Ying ^a   Xie, Jianying ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

FEEDBACK; GRAPH THEORY; HEURISTIC METHODS; MATRIX ALGEBRA; MULTIMEDIA SYSTEMS; OPTIMIZATION; PROBABILITY; ROUTERS; SET THEORY; TELECOMMUNICATION NETWORKS;

ANT COLONY OPTIMIZATION (ACO); HEURISTIC ALGORITHMS; MULTICAST ROUTING;

MULTICASTING;

EID: 2342509619     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. L. Kyou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees", Acta Info., vol. 15, no. 2, pp. 141-145, 1981.
2. H. Esbensen, "Computing near-optimal solutions to the Steiner problem in a graph", Networks, vol. 26, pp. 173-185, 1995.
3. A. Kapsalis, V. J. Rayward-Smith, and G. D. Smith, "Solving the graphical Steiner tree problem using genetic algorithms", J. Oper. Res.Soc., vol. 44, no. 4, pp. 397-406, 1993.
4. Marco Dorigo, Vittorio Maniezzo, and Alberto Colorni, "The Ant System: Optimization by a colony of cooperating agents", IEEE Transactions on Systems, Man, and Cybernetics - Part B, vol.26, no.1, pp.1-13, 1996.
5. M Dorigo. & L.M. Gambardella, "Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem", IEEE Transactions on Evolutionary Computation, vol.1, no.1, pp53-66, 1997.
6. M Dorigo. & L.M. Gambardella, "Ant Colonies for the Traveling Salesman Problem", BioSystems, vol.43, pp73-81, 1997.
7. Schoonderwoerd R., O. Holland, J. Bruten and L. Rothkrantz, "Ant-based Load Balancing in Telecommunications Networks", Adaptive Behavior, vol.5, no.2,: pp169-207, 1997.
8. R.Schoonderwoerd, O. Holland and J. Bruten, "Ant-like Agents for Load Balancing in Telecommunication Networks", Proceedings of Agents'97, ACM Press, pp209-216, 1997.