{'fraction_non_alphanumeric': 0.006024096385542169, 'fraction_numerical': 0.0, 'mean_word_length': 5.48051948051948, '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}}
Solving the Traveling Repairman problem with differentiated waiting times through Lagrangian relaxation

In this paper we present a formulation of the traveling repairman problem with differentiated waiting times that is derived from the extended disaggregated flow formulation for the asymmetric traveling salesman problem. We focus on the usage of the Lagrangian approach as a mechanism of speeding up the solution of the linear relaxation by a simplex method. We show some computational results.