Letter Computation of Constrained Multicast Trees Using a Genetic Algorithm
Quan Sun, Horst Langendoerfer · European Transactions on Telecommunications · 1999
Abstract This paper shows that the genetic algorithm can be used to solve the delay‐constrained least‐cost least‐inter‐destination‐delay‐variation multicast problem efficiently. The proposed genetic algorithm performs well when the number of destination nodes is small relative to the size of the network.