{'fraction_non_alphanumeric': 0.025, 'fraction_numerical': 0.007352941176470588, 'mean_word_length': 5.4245283018867925, '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}}
Enhancing Incremental Ant Colony Algorithm for Continuous Global Optimization

We present two enhancements to the local search strategy for Incremental Ant Colony Algorithm (IACOR), that uses Multi-Trajectory Local Search (Mtsls1) as the exploitation engine. First, a new method to handle bound constraints and a modified architecture for Mtsls1 is proposed. The second approach involves a parallel architecture for Mtsls1 along each dimension of the function. We evaluate our approaches on the Soft Computing (SOCO) benchmark functions. The reference approach takes 16% more function evaluations on an average. The proposed parallel approach provides a reduction in the run-time.