{'fraction_non_alphanumeric': 0.01878612716763006, 'fraction_numerical': 0.0, 'mean_word_length': 5.078947368421052, '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}}
Modified Max-Min Ant Colony System for Solving Pseudo-Boolean Optimization Problem

Based on the max-min ant system solving the Pseudo-Boolean Optimization problem, we improved the process of solving the problem. An memory array is introduced to record changes of each bit string, memory array to be used for optimization of the solution of the current iteration. Such improvements will help improve the convergence rate of Max-Min ant colony algorithm. The improved algorithm was applied to solve the problem of Pseudo-Boolean functions. Experiments show a reduction in the number of iteration before achieving the optimal which indicating the effectiveness and Superiority of the algorithm.