{'fraction_non_alphanumeric': 0.014705882352941176, 'fraction_numerical': 0.0, 'mean_word_length': 5.4526315789473685, '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}}
Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty

In this paper, we study the capacitated arc routing problem over sparse underlying graphs under travel costs uncertainty. In particular, we work with Multiple-Scenario Min-Max CARP over sparse underlying graphs. We present a mathematical formulation of the problem. A greedy heuristic algorithm and an adapted tabusearch algorithm are developed to solve the problem. The computational experiments show the effectiveness of these two algorithms for different sizes of instances as well for different number of scenarios.