Abstract:

This paper studies bandwidth delay and the delay variation constrained leastcost QoS multicast routing problem and proposes a genetic simulated annealing algorithm which can speed up the evolutionary rate and avoid antiprecocity. The algorithm adopts tree structure coding and improved cross and variation operations, and combines the merits in the partial search ability of the simulation annealing algorithm. It constructes a neighbor set in the range of feasible solutions and gives a new criterion for judging the premature convergence.The simulation results show that the revised algorithm has a more rapid convergence rate in the global optimal solution than the only genetic algorithm and the simulated annealing algorithm.

Key words: multicast routing;genetic simulated annealing;multicast tree