@article{ART001253735},
author={이승관},
title={Elite Ant System for Solving Multicast Routing Problem},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2008},
volume={13},
number={3},
pages={147-152}
TY - JOUR
AU - 이승관
TI - Elite Ant System for Solving Multicast Routing Problem
JO - Journal of The Korea Society of Computer and Information
PY - 2008
VL - 13
IS - 3
PB - The Korean Society Of Computer And Information
SP - 147
EP - 152
SN - 1598-849X
AB - Ant System(AS) is new meta heuristic for hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem. In this paper, AS is applied to the Multicast Routing Problem. Multicast Routing is modeled as the NP-complete Steiner tree problem. This is the shortest path from source node to all destination nodes. We proposed new AS to resolve this problem. The proposed method selects the neighborhood node to consider all costs of the edge and the next node in state transition rule. Also, The edges which are selected elite agents are updated to additional pheromone. Simulation results of our proposed method show fast convergence and give lower total cost than original AS and ASelite.
KW -
DO -
UR -
ER -
이승관. (2008). Elite Ant System for Solving Multicast Routing Problem. Journal of The Korea Society of Computer and Information, 13(3), 147-152.
이승관. 2008, "Elite Ant System for Solving Multicast Routing Problem", Journal of The Korea Society of Computer and Information, vol.13, no.3 pp.147-152.
이승관 "Elite Ant System for Solving Multicast Routing Problem" Journal of The Korea Society of Computer and Information 13.3 pp.147-152 (2008) : 147.
이승관. Elite Ant System for Solving Multicast Routing Problem. 2008; 13(3), 147-152.
이승관. "Elite Ant System for Solving Multicast Routing Problem" Journal of The Korea Society of Computer and Information 13, no.3 (2008) : 147-152.
이승관. Elite Ant System for Solving Multicast Routing Problem. Journal of The Korea Society of Computer and Information, 13(3), 147-152.
이승관. Elite Ant System for Solving Multicast Routing Problem. Journal of The Korea Society of Computer and Information. 2008; 13(3) 147-152.
이승관. Elite Ant System for Solving Multicast Routing Problem. 2008; 13(3), 147-152.
이승관. "Elite Ant System for Solving Multicast Routing Problem" Journal of The Korea Society of Computer and Information 13, no.3 (2008) : 147-152.
