{'fraction_non_alphanumeric': 0.025136612021857924, 'fraction_numerical': 0.0, 'mean_word_length': 5.49645390070922, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Quantum Clonal Algorithm for Multicast Routing Problem

The bounded shortest multicast algorithm (BSMA) is believed the best constrained multicast algorithm. However, the large computation time restricts its application. As a global optimizing algorithm, genetic algorithm (GA) is applied to solve the problem of multicast more and more. GA has more powerful searching ability than traditional algorithm, however its property of “prematurity” makes it difficult to get a good multicast tree. A quantum clonal algorithm (QCA) to deal with multicast routing problem is presented in this paper, which saliently solves the “prematurity” problem in Genetic based multicast algorithm. Furthermore, the algorithm is accelerated by using quantum crossover. The algorithm has the property of simple realization and flexible control. The simulation results show that QCA has a better performance than BSMA and traditional GA.