Degree-constrained minimum spanning tree problem using genetic algorithm

Computer network technology has been growing explosively and the multicast technology has become a hot Internet research topic. The main goal of multicast routing algorithm is seeking a minimum cost multicast tree in a given network, also known as the Steiner tree problem, which is a classical NP-Complete problem. We measure the multicast capability of each node through the degree-constraint for each node and discuss the problem of multicast in the case of degree-constraint, which has an important significance in the communication network. Limiting the capacity of each node during the replication process of information transmission can improve the speed of the network, which has an important significance in real-time service. In this paper, we solve constrained multicast routing algorithm based on genetic algorithm. The idea is to simulate the Darwinian theory of biological evolution. At the same time, we improve the generating random tree and replace the variation by the combination of the two variations. On one hand, we improve the efficiency of generating random tree and on the other hand, we can control the mutation of different variations in a more flexible manner.