This paper studies the difference algorithm parameters characteristic of the multicast routing problem, and to compare it with genetic algorithms. The algorithm uses the path of individual coding, combined with the di...This paper studies the difference algorithm parameters characteristic of the multicast routing problem, and to compare it with genetic algorithms. The algorithm uses the path of individual coding, combined with the differential cross-choice strategy and operations optimization. Finally, we simulated 30 node networks, and compared the performance of genetic algorithm and differential evolution algorithm. Experimental results show that multi-strategy Differential Evolution algorithm converges faster and better global search ability and stability.展开更多
文摘This paper studies the difference algorithm parameters characteristic of the multicast routing problem, and to compare it with genetic algorithms. The algorithm uses the path of individual coding, combined with the differential cross-choice strategy and operations optimization. Finally, we simulated 30 node networks, and compared the performance of genetic algorithm and differential evolution algorithm. Experimental results show that multi-strategy Differential Evolution algorithm converges faster and better global search ability and stability.
