{'fraction_non_alphanumeric': 0.02725563909774436, 'fraction_numerical': 0.0, 'mean_word_length': 5.7834394904458595, '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}}
Self-adaptation in Bacterial Foraging Optimization algorithm

Bacterial foraging optimization (BFO) is a recently developed nature-inspired optimization algorithm, which is based on the foraging behavior of E. coli bacteria. However, BFO possesses a poor convergence behavior over complex optimization problems as compared to other nature-inspired optimization techniques like genetic algorithm (GA) and particle swarm optimization (PSO). This paper first analyzes how the run-length unit parameter controls the exploration and exploitation ability of BFO, and then presents a variation on the original BFO algorithm, called the self-adaptive bacterial foraging optimization (SA-BFO), employing the adaptive search strategy to significantly improve the performance of the original algorithm. This is achieved by enabling SA-BFO to adjust the run-length unit parameter dynamically during evolution to balance the exploration/exploitation tradeoff. Application of SA-BFO on several benchmark functions shows a marked improvement in performance over the original BFO.