{'fraction_non_alphanumeric': 0.011273957158962795, 'fraction_numerical': 0.002254791431792559, 'mean_word_length': 5.778625954198473, '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}}
A new transgenetic approach for the biobjective spanning tree problem

This paper addresses a new transgenetic approach to the biobjective spanning tree, an NP-hard combinatorial optimization problem which can model different real applications on network design. The metaheuristic is inspired on endosymbiosis and horizontal gene transfer, two main evolutionary forces. The proposed algorithm is applied to 78 instances with different structures. The results concerning the quality of the approximation sets obtained with the proposed approach are compared to others previously published in the literature with basis on a Pareto compliant quality indicator. Comparisons regarding processing times are also reported. Statistical tests show that the proposed approach is comparable with the algorithms presented in the literature, outperforming them in solution quality for most instances.