{'fraction_non_alphanumeric': 0.015931372549019607, 'fraction_numerical': 0.0, 'mean_word_length': 5.236641221374046, '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}}
A competitive PSO based on evaluation with priority for finding plural solutions

In this paper, we propose a simple competitive PSO for finding plural solutions. In the proposed PSO, particles are divided into groups corresponding to the required number of solutions. Each group simultaneously searches solutions having a priority search region. This region affects to prohibit that different groups search the same solutions. The proposed PSO can effectively find desired plural acceptable solutions with a high accuracy and with a low computation cost, and can easily control combinations of these solutions by adjusting a parameter. Also, the proposed PSO is applied to a problem in wireless sensor networks (WSNs). The simulation results show that obtained results can contribute to prolonging lifetime of WSNs.