{'fraction_non_alphanumeric': 0.02168021680216802, 'fraction_numerical': 0.0, 'mean_word_length': 5.057377049180328, '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 Adaptive Genetic Algorithms for Job Shop Scheduling Problems

In this paper, the adaptability of the genetic algorithm (GA) is considered. Two improved adaptive genetic algorithms (AGA) which are called Ch-AGA and Th-AGA for short are proposed based on the previous AGA. The crossover probability and the mutation probability of the Ch-AGA and the Th-AGA are non-linear changed between some a certain region, and adopted the mathematical function of chx and thx respectively. The two improved adaptive genetic algorithms are used to solve the classical job shop scheduling problems and the results indicate that the algorithms are more effective and more efficient than previous AGA, and should be used in practical applications.