A competitive PSO based on evaluation with priority for finding plural solutions
Yu Taguchi, Yuta Kanamori, Hidehiro Nakano, Akihide Utani, Arata Miyauchi, Hisao Yamamoto · 2010
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.