An Improved Genetic Algorithm for QOS Multicast Routing

Aiming at the problem of multicast routing with multiple QoS constraint, such as delay, bandwidth, losing rate, a new genetic algorithm is brought up based on the k-th shortest path in this paper. Our algorithm outputs an approximate Steiner tree satisfying all QoS constraint of multicast request in a network with e edges and v vertices, in time O(e⁺vlogv⁺kv). Under the genetic algorithm we proposed, a set of new methods in coding, crossover and mutation operation are also introduced which effectively improving the convergence of the genetic algorithm.