{'fraction_non_alphanumeric': 0.008363201911589008, 'fraction_numerical': 0.0, 'mean_word_length': 4.901408450704225, '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}}
An Evolutionary Hybrid Strategy for Solving the Rural Postman Problem

The Rural Postman Problem (RPP) is a classical arc routing problem proven to be NP-Hard whith applications in many contexts of practical interest. A common strategy for solving RPP instances is to first determine a suitable graph transformation in order to either reduce the dimensionality of the search space or to produce a single cursus graph to derive an Eulerian circuit in polynomial time. In this paper we present a simple but effective hybrid heuristic for the RPP that uses such a graph transformation and finds solutions using a Genetic Algorithm for global search and a local search algorithm to compute optimal traversal directions of a solution tour. Our approach is tested on a set of instances than have been already used in previously published work.