{'fraction_non_alphanumeric': 0.01827956989247312, 'fraction_numerical': 0.001075268817204301, 'mean_word_length': 5.510489510489511, '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}}
The Satellite List and New Data Structures for Symmetric Traveling Salesman Problems †

The problem of data representation is fundamental to the efficiency of search algorithms for the traveling salesman problem (TSP). The computational effort required to perform such tour operations as traversal and subpath reversal considerably influence algorithm design and performance. We propose new data structures—the satellite list and k-level satellite tree—for representing a TSP tour with a discussion of properties in the framework of general tour operations. Theory suggests that the satellite list data structure is superior in representation to its widely used counterpart, the doubly-linked list, as well as useful in improving and extending the specialized 2-level tree structure for symmetric graph-based optimization problems. The k-level satellite tree representation is shown to be far more efficient than its predecessors.