{'fraction_non_alphanumeric': 0.022592152199762187, 'fraction_numerical': 0.0023781212841854932, 'mean_word_length': 5.2835820895522385, '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}}
Boolean Binary Cat Swarm Optimization Algorithm

The behavior of domestic cats inspired the Cat Swarm Optimization (CSO) algorithm. The algorithm presents two modes of operation: seeking mode, representing the resting state, and tracing mode, in which the cats are hunting preys. In this paper, we introduce a boolean based operator, resulting in the Boolean Binary Cat Swarm Optimization algorithm (BBCSO). In our proposal, we change the selection of the agents to different modes and present a new way to determine the position and the velocity of the agents, using Boolean functions. The computational results demonstrate the viability of the proposal since it overcomes the original versions of the binary genetic algorithm and the binary particle swarm optimization in the 0/1 knapsack problem, especially in high dimensional instances.