{'fraction_non_alphanumeric': 0.02064516129032258, 'fraction_numerical': 0.005161290322580645, 'mean_word_length': 5.015503875968992, '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}}
A hybrid approach for the dynamic vehicle routing problem with time windows

The vehicle routing problem with time windows (VRPTW) is a well-known and complex combinatorial problem. The static version of this problem has received special attention. However, most real world vehicle routing problems are dynamic, where information relevant to the routing can change after the initial routes have been constructed. The common approach in this scenario is to restart the algorithm when novel information arrives, but this type of restart methods does not use the memory to improve the quality of the final result. In this paper, the hybrid CGH column generation heuristic (Alvarenga et al., 2005) is modified in order to use the routes generated during the optimization process.