{'fraction_non_alphanumeric': 0.010830324909747292, 'fraction_numerical': 0.0, 'mean_word_length': 5.453488372093023, '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}}
Bee colony foraging algorithm for integer programming

In order to solve integer programming, a bee colony foraging algorithm is proposed, which is based on the law of foraging bees. The principle of optimization algorithm is discussed and the implementation of the method is presented. The performance of bee colony foraging algorithm is compared with particle swarm optimization and chaotic ant swarm. The experimental results show bee colony foraging algorithm can handle integer programming efficiently and performs much better than other algorithms.