{'fraction_non_alphanumeric': 0.00927643784786642, 'fraction_numerical': 0.0, 'mean_word_length': 5.579268292682927, '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}}
Comparison of different topologies for island-based multi-colony ant algorithms for the minimum weight vertex cover problem

The aim of this paper is compare the effect of using different topologies or connections between separate colonies in island based parallel implementations of the Ant Colony Optimization applied to the Minimum Weight Vertex Cover Problem. We investigated the sequential Ant Colony Optimization algorithms applied to the Minimum Weight Vertex Cover Problem before. Parallelization of population based algorithms using the island model is of great importance because it often gives super linear increase in performance. We observe the behavior of different parallel algorithms corresponding to several topologies and communication rules like fully connected, replace worst, ring and independent parallel runs. We also propose a variation of the algorithm corresponding to the ring topology that maintains the diversity of the search, but still moves to areas with better solutions and gives slightly better results even on a single processor with threads.