{'fraction_non_alphanumeric': 0.021739130434782608, 'fraction_numerical': 0.0, 'mean_word_length': 5.214285714285714, '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 real urban VRPTW instances by applying a Branch-Cut-and-Price via VRPsolver

In this work, the Vehicle Routing Problem with Time Windows (VRPTW) is addressed as a way of incorporating dynamic characteristics of the urban express delivery logistics chain, exploring theoretical aspects that best define the problem and its instances. The problem is to determine minimum cost routes that must be performed by a fleet respecting the capacities of vehicles and the time windows associated with each delivery. A strategy that uses the Branch-Cut-and-Price method through the VRPsolver tool was applied to two sets of instances, the first being Solomon’s artificial classical instances and, the second, real instances of Brazilian urban cities adapted from the loggiBUD benchmark.