LAUSR

Due to the lack of global search capacity, most evolutionary or swarm intelligence based algorithms show their inefficiency when optimizing multi-modal problems. In this paper, we propose a grouping particle swarm optimizer (GPSO) to solve this kind of problem. In the proposed algorithm, the swarm consists of several groups. For every several iterations, an elite group is constructed and used to replace the worst one. The thought of grouping is helpful for improving the diversity of the solutions, and then enhancing the global search ability of the algorithm. In addition, we apply a simple mutation operator to the best solution so as to help it escape from local optima. The GPSO is compared with several variants of particle swarm optimizer (PSO) and some state-of-the-art evolutionary algorithms on CEC15 benchmark functions and three practical engineering problems. As demonstrated by the experimental results, the proposed GPSO outperforms its competitors in most cases.