{'fraction_non_alphanumeric': 0.011406844106463879, 'fraction_numerical': 0.0038022813688212928, 'mean_word_length': 5.506172839506172, '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 hybrid adaptive genetic algorithm for solving knapsack problem

The paper solves the 0–1 knapsack problem with the hybrid adaptive genetic algorithm which combined with greedy algorithm. It presents a method for optimal design of an improved adaptive genetic algorithm and repairs the infeasible solution with greedy algorithm. Experimental results show that the new algorithm has faster convergent speed, higher robustness and more reliable stability, so this is a very attractive new approach being full of promise.