{'fraction_non_alphanumeric': 0.030723488602576808, 'fraction_numerical': 0.0, 'mean_word_length': 6.013888888888889, '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 Decomposition-Combination Optimization Method for Network Multiobjective Optimization Problems

In recent years, an increasing number of multiobjective evolutionary algorithms (MOEAs) have been developed for solving multiobjective optimization problems (MOPs). However, a special type of network-oriented MOPs, termed network multiobjective optimization problems (NMOPs), remains largely unexplored. In this paper, we put forth a general formulation for NMOPs, and propose the network decomposition-combination multiobjective optimization method (NDCMOM) for solving them. NDCMOM adopts a network decomposition mechanism, which breaks the NMOP down to a series of MOPs with smaller scales. The solutions to the NMOP can be obtained by combining the solutions to these smaller-scale MOPs. This decomposition-combination mechanism significantly improves the optimization efficiency. Experiments are conducted to demonstrate that the proposed NDCMOM outperforms the state-of-the-art MOEAs on large-scale NMOPs.