{'fraction_non_alphanumeric': 0.01568627450980392, 'fraction_numerical': 0.0, 'mean_word_length': 5.436974789915967, '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}}
Local search for dynamic vehicle routing problem with time windows

Vehicle Routing Problems have been extensively analyzed to reduce transportation costs. More particularly, the Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) imposes the period of time of customer availability and the request time of customer as two constraints, which precisely reflects the real world situations. Using minimization of the total distance as the main objective to be fulfilled, this paper proposes a general framework to deal with DVRPTW. Based on this framework, different local search heuristics are also designed to wisely adjust the convergence speed. Extensive experiments are conducted. And the results prove the effectiveness and the efficiency of our approach.