{'fraction_non_alphanumeric': 0.013059701492537313, 'fraction_numerical': 0.0, 'mean_word_length': 5.7974683544303796, '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 Hybrid Genetic Algorithm for Multiway Graph Partitioning

A hybrid genetic algorithm for multiway graph partitioning is proposed. The algorithm includes an efficient local optimization heuristic. Starting at an initial solution, the heuristic iteratively improves the solution using cyclic movements of vertices. The suggested heuristic performed well in itself and as a local optimization engine in the hybrid genetic algorithm. Combined with the framework of hybrid genetic algorithms, it showed significant performance improvement.