The memetic algorithm for the minimum spanning tree problem with degree and delay constraints

As the critical technology of many real-time applications, application layer multicast requirements limit the transmission time and the number of receivers to which each node can transmit. Such a communication scheme in an overlay network can be regarded as a degree- and delay-constrained minimum spanning tree (DDCMST) problem, and appears to be NP-complete. This paper proposes a novel Memetic algorithm(MA) to solve the DDCMST problem and compares it with some related methods. The results of a series of simulations show the efficiency and effectiveness of the proposed algorithm.