{'fraction_non_alphanumeric': 0.028896672504378284, 'fraction_numerical': 0.002626970227670753, 'mean_word_length': 5.531428571428571, '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}}
Dynamic Reduction-Expansion Operator to Improve Performance of Genetic Algorithms for the Traveling Salesman Problem

The Traveling Salesman Problem (TSP) is an important routing problem within the transportation industry. However, finding optimal solutions for this problem is not easy due to its computational complexity. In this work, a novel operator based on dynamic reduction-expansion of minimum distance is presented as an initial population strategy to improve the search mechanisms of Genetic Algorithms (GA) for the TSP. This operator, termed as RedExp, consists of four stages: (a) clustering to identify candidate supply/demand locations to be reduced, (b) coding of clustered and nonclustered locations to obtain the set of reduced locations, (c) sequencing of minimum distances for the set of reduced locations (nearest neighbor strategy), and (d) decoding (expansion) of the reduced set of locations. Experiments performed on TSP instances with more than 150 nodes provided evidence that RedExp can improve convergence of the GA and provide more suitable solutions than other approaches focused on the GA’s initial population.