{'fraction_non_alphanumeric': 0.01918158567774936, 'fraction_numerical': 0.0, 'mean_word_length': 5.579831932773109, '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 GAs with case-based initial populations for real-time solution of combinatorial problems

Combinatorial problems are NP-complete, which means even infinite number of CPUs take polynomial time to search an optimal solution. Therefore approximate search algorithms such as Genetic Algorithms are used. However, such an approximate search algorithm easily falls into local optimum and just distributed / parallel processing seems inefficient. In this paper, we introduce distributed GAs, which compute their initial population in a case-based manner and compose their upcoming generations by the particular GAs, which exchange their solutions and make their individual decisions, when composing a next generation based on the fitness of the candidates and diversity issues.