Heuristic genetic algorithm for degree-constrained multicast routing problem

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.