{'fraction_non_alphanumeric': 0.014687882496940025, 'fraction_numerical': 0.0, 'mean_word_length': 5.816666666666666, '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}}
Improved Self-Adaptive Genetic Algorithm and its Application on the Dynamic Stochastic Shortest Path Problem

In reality transportation network is dynamic and stochastic. Studies on the dynamic stochastic shortest path problem are of great research and application value. This paper introduces basic genetic algorithm into it. Then an improved self-adaptive genetic algorithm is proposed by improving population initialization, selection strategy, crossover strategy and mutation strategy. In addition, the improved genetic algorithm adjusts the crossover and mutation factors adaptively. The results of simulation experiment show that the improved genetic algorithm proposed by this paper has much higher capacity of global optimization than Dijkstra and A* algorithm in the dynamic stochastic shortest path problem.