Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2003.10A.4.369

A Study of Ant Colony System Design for Multicast Routing  

Lee, Sung-Geun (청강문화산업대학)
Han, Chi-Geun (경희대학교 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartA / v.10A, no.4, 2003 , pp. 369-374 More about this Journal
Abstract
Ant Algorithm is used to find the solution of Combinatorial Optimization Problems. Real ants are capable of finding the shortest path from a food source to their nest without using visual informations. This behavior of real ants has inspired ant algorithm. There are various versions of Ant Algorithm. Ant Colony System (ACS) is introduced lately. ACS is applied to the Traveling Salesman Problem (TSP) for verifying the availability of ACS and evaluating the performance of ACS. ACS find a good solution for TSP When ACS is applied to different Combinatorial Optimization Problems, ACS uses the same parameters and strategies that were used for TSP. In this paper, ACS is applied to the Multicast Routing Problem. This Problem is to find the paths from a source to all destination nodes. This definition differs from that of TSP and differs from finding paths which are the shortest paths from source node to each destination nodes. We introduce parameters and strategies of ACS for Multicasting Routing Problem.
Keywords
Ant Colony System; Steiner Tree; Ant Algorithm; Multicast Routing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. R. Garey, D. S. Johnson, 'Computer And Interactability : A Guide to the Theory of NP-Completeness,' FREEMAN AND COMPANY, 1983
2 L. Kyou, G. Markowsky and L. Berman, 'A Fast Algorithm for Steiner Trees,' Acta Info., Vol.15, No.2, pp.141-145, 1981   DOI
3 Ying Wang and Jianying Xie, 'Ant Colony Optimization for Multicast Routing,' The 2000 Asia-Pacific IEEE Conference, pp.243-246, 2000   DOI
4 Ying LIU, Jianping WU, Ke Xu and Mingwei Xu, 'The Degree-Constrained Multicasting Algorithm Using Ant Algorithm,' Telecommunication, ICT 2003. 10th International Conference, Vol.1, pp.370-374, 2003   DOI
5 M. Dorigo, 'Optimization, Learning and Natural Algorithm,' Ph.D. Dissertation, DEI, Politecnico di Milano, Italy, 1992
6 L. P. Kaelbling, L. M. Littman and A. W. Moore, 'Reinforcement Learning: a Survey,' J. Artif. Intell. Res., Vol.4, pp.237-285, 1996
7 Luca M. Gambardella and Marco Dorigo, 'Ant-O : A Reinforcement Learning Approach to the Travelling Salesman Problem,' Proceedings of ML-95, Twelfth Intern. Conf. on Machine Learning, pp.252-260, 1995
8 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-404, 1993   DOI
9 Marco Dorigo, 'Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem,' IEEE transactions on Evolutionary Computation, Vol.1, No.1, pp. 53-66, 1997   DOI
10 M. Dorigo, V. Maniezzo and A. Colomi, 'The Ant System: Optimization by a Colony of Cooperating Agents,' IEEE Trans. Syst, Man, Cybem, E., Vol.26, No.2, pp.29-41, 1996   DOI