{'fraction_non_alphanumeric': 0.015197568389057751, 'fraction_numerical': 0.001519756838905775, 'mean_word_length': 5.724489795918367, '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}}
Grafted genetic algorithm and its application

Genetic algorithm has found its application in various engineering areas, but it has the limitation of premature convergence and exhausting computing amount when applied in the job-shop scheduling problems. Aiming at these limitations, a new hybrid genetic algorithm called grafted genetic algorithm (GGA) is developed for job-shop scheduling problem. The introductions of grafted population and crossover probability matrix enhance the ability of the GGA to accelerate the evolvement and to fight premature convergence. Finally, the effectiveness and high efficiency are illustrated with the 6 classic examples