{'fraction_non_alphanumeric': 0.017955801104972375, 'fraction_numerical': 0.0, 'mean_word_length': 5.473214285714286, '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}}
Distributed Cooperation Model of Multi Objective Genetic Algorithms

In this paper, a new algorithm of Genetic Algorithm for Multi objective Optimization Problems, called Distributed Cooperation model of MOGA (DCMOGA), is proposed. In the proposed algorithm, there are several sub populations. One of them is for finding a Pareto optimum set and the others are for each finding an optimum solution of one of the objectives. These sub populations sometimes exchange their searching information respectively. The proposed algorithm is applied to three types of knapsack test problems. Comparing to the conventional multi objective optimization methods, the proposed model found the better and much widespread Pareto solutions.