DocumentCode
424231
Title
Heuristic genetic algorithm for degree-constrained multicast routing problem
Author
Feng, Yan-Li ; Yu, Zhen-Wei ; Pan, Yun
Author_Institution
Dept. of Comput., China Univ. of Min. & Technol., Beijing, China
Volume
4
fYear
2004
fDate
26-29 Aug. 2004
Firstpage
2448
Abstract
We combine the heuristic search methods with genetic algorithms by using the chromosome as heuristic information for global searching, and propose a new heuristic genetic algorithm (HGA) to solve degree-constrained multicast routing problem. The complexity of the new algorithm is analyzed. Its efficiency is also confirmed by a great number of numerical experiments and compared favorably to competing algorithms in the literature.
Keywords
genetic algorithms; multicast communication; search problems; telecommunication network routing; degree-constrained multicast routing problem; global searching; heuristic genetic algorithm; heuristic search method; Algorithm design and analysis; Bandwidth; Communication system traffic control; Computer industry; Costs; Electronic mail; Genetic algorithms; Multicast algorithms; Routing; Search methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Print_ISBN
0-7803-8403-2
Type
conf
DOI
10.1109/ICMLC.2004.1382214
Filename
1382214
Link To Document