{'fraction_non_alphanumeric': 0.02383939774153074, 'fraction_numerical': 0.0, 'mean_word_length': 4.824817518248175, '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}}
Utilization of graph coarsening for improving of results of a genetic algorithm for road traffic network division

In this paper, the optimization of a genetic algorithm for the road traffic network division using the graph coarsening is discussed. Since each road traffic network is basically a graph, the main idea is to coarsen a large road traffic network to obtain a smaller (i.e., coarser) network. This smaller road traffic network can be then divided into required number of sub-networks using our division method based on a genetic algorithm. The division of the coarser network can be then projected to the original road traffic network. The coarsening algorithm, which utilizes the geographical coordinates of the crossroads (i.e., nodes of the graph) is described in detail and tested.