{'fraction_non_alphanumeric': 0.020289855072463767, 'fraction_numerical': 0.0, 'mean_word_length': 5.683870967741935, '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}}
Research on Vehicle Routing Problem with time Windows Based on the Dragonfly Algorithm

The vehicle routing problem(VRP) plays a key role in the logistics industry which constrains the development of the logistics industry. In order to improve the distribution efficiency in logistics distribution and reduce the empty driving rate, driving distance of vehicles, and transportation costs, this paper studies the vehicle routing problem with time window constraints (VRPTW). Firstly, based on the logistics costs factors such as freight transportation costs, warehouse resident costs, and overtime penalty costs, this paper constructs a mathematical model of vehicle routing problem with time windows considering the minimization of integrated costs. Then, according to the mathematical model, we design a way of using the Dragonfly Algorithm (DA) to solve the vehicle routing problem with time windows. Finally, the effectiveness and feasibility of the dragonfly algorithm in solving the problem are verified by simulation experiments.