Multi-Agent immune clonal selection algorithm based multicast routing

Authors:
Fang Liu;Yuan Liu;Xi Chen;Jin-shi Wang
Affiliations:
School of Computer Science and Engineering, Xidian University, Xi'an, China;School of Computer Science and Engineering, Xidian University, Xi'an, China;School of Computer Science and Engineering, Xidian University, Xi'an, China;School of Computer Science and Engineering, Xidian University, Xi'an, China
Venue:
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Year:
2006

Citing 5
Cited 0

An iterative algorithm for delay-constrained minimum-cost multicasting

IEEE/ACM Transactions on Networking (TON)
An organizational coevolutionary algorithm for classification

IEEE Transactions on Evolutionary Computation
A multiagent genetic algorithm for global numerical optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A multiagent evolutionary algorithm for constraint satisfaction problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A novel genetic algorithm based on immunity

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

The least-cost multicast routing with delay constrained is an NP-Complete problems, to deal with which, a Multi-Agent Immune Clonal Selection Algorithm based multicast routing (MAICSA) is proposed in this paper. MAICSA combines the characteristic of Multi-Agent with the search strategy of Immune Clonal Selection Algorithm. To compare with the conventional Genetic Algorithm (GA), MAICSA overcomes the most serious drawbacks, such as slow convergence rate and “prematurity”. The experimental results show that MAICSA has faster astringency and higher precision than traditional GA, MAGA (Multi-Agent multicast routing based on Genetic Algorithm) and MAIA (Multi-Agent multicast routing based on Immune Algorithm).