{'fraction_non_alphanumeric': 0.02346368715083799, 'fraction_numerical': 0.0, 'mean_word_length': 5.3546099290780145, '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}}
An Improved Genetic Algorithm for Vehicle Routing Problem

The Vehicle Routing Problem (VRP) is a typical combinational optimization problem. Genetic Algorithm (GA) is one of the methods used to solve VRP. By incorporating Simulated Annealing (SA) into GA, an improved genetic algorithm is proposed to solve the classical VRP in this paper. To improve the computational efficiency of GA, an improved inversion mutation operation is also exploited so that more parents' excellent performance can be inherited by off-springs. A measure, individual concentration, is introduced to evaluate population diversity. Once population diversity is below a given level, the algorithm is switched to SA, which could avoid the drawback of premature convergence in GA. Some experimental data show the effectiveness of the algorithm and authenticate the search efficiency and solution quality of the algorithm.