본문 바로가기
  • Home

Elite Ant System for Solving Multicast Routing Problem

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2008, 13(3), pp.147-152
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

이승관 1

1경희대학교

Accredited

ABSTRACT

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.

Citation status

* References for papers published after 2022 are currently being built.