{'fraction_non_alphanumeric': 0.00980392156862745, 'fraction_numerical': 0.0, 'mean_word_length': 5.385416666666667, '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}}
Vehicle scheduling base on the improved particle swarm

In order to effectively prevent particle swarm into local optimum and enhance the ability of particles to find the optimal solution, the paper proposes an improved particle swarm algorithm. The paper is on the background of vehicle scheduling, which is using the load priority strategy, and establishes the model for vehicle scheduling problem with load and vehicle scheduling problem with soft time windows. The experimental results show that the improved particle swarm can quickly and efficiently obtain the optimal solution for vehicle routing problem.