{'fraction_non_alphanumeric': 0.03203943314849045, 'fraction_numerical': 0.014787430683918669, 'mean_word_length': 4.948717948717949, '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}}
Heuristics and metaheuristics approaches used to solve the Rural Postman Problem : A Comparative Case Study

The Rural Postman Problem (RPP) consists of determining a minimum cost tour of a specified arc set of a graph (G=(V,A)) with the particularity that only a subset T (T ⊆ A) of arcs is required to be traversed at least once. The arcs can be directed, undirected or both. This problem appears in a variety of practical contexts like mail, fuel and newspaper deliveries, school bus routing, electrical lines inspection, etc. (Frederickson, 1979). RPP is a NP-hard problem, therefore it has been tackled with some heuristics and metaheuristics due to the difficulty of using exact approaches to global optimality. Up to now, and based in computational results using 26 instances described in Christofides et al. (1981) and in Corberán & Sanchis (1994), an heuristic algorithm for the RPP by Fernández de Córdoba et al. (1998) based on Monte Carlo method had obtained the best results. Baldoquín et al. (2002) developed a hybrid approach based on GRASP and Genetic Algorithm comparable with the above method testing the same instances. In this paper a new hybrid approach based on Simulated Annealing, GRASP and Genetic Algorithm is introduced to solve the Undirected Rural Postman Problem (URPP). We describe the design of a computational experiment to compare the performance of Monte Carlo and the two hybrid method mentioned before, using the same 26 instances. Computational results indicate that the new hybrid approach presented in this paper, and considering the instances tested, outperformed the other methods.