{'fraction_non_alphanumeric': 0.01390644753476612, 'fraction_numerical': 0.0, 'mean_word_length': 5.439024390243903, '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 Modified Genetic Algorithm for the Postal Vehicle Scheduling Problem

The postal vehicle scheduling problem plays an important role in the post services management. Firstly, the formulation of the postal vehicle scheduling problem is proposed. Secondly, a modified genetic algorithm is put forward. In the algorithm, an encoding ways with trip delimiters are designed. Roulette selection method integrated with elitist strategy is used to select the better chromosomes to generate a new population. The crossover procedure and the mutation procedure are discussed to satisfy the special encoding ways. Finally, the experiment with the benchmark instances shows the effectiveness and efficiency of the proposed approach with which the postal vehicle scheduling problem can be solved easily.