A Pair-wise Bare Bones Particle Swarm Optimization Algorithm for Nonlinear Functions

DOI

10.2991/ijndc.2017.5.3.3How to use a DOI?

Keywords

Bare bones, particle swarm optimization, pair-wise, diversity increasing

Abstract

Bare bones particle swarm optimization is a parameter-free swarm intelligence algorithm which is famous for easy applying. It has aroused wide concern of academic circle on its principles and applications in recent years. However, losing the diversity quickly still causes the premature convergence in the iteration process. Hence, a pair-wise bare bones particle swarm optimization algorithm is proposed in this paper to balance the exploration and exploitation. Moreover, a separate iteration strategy is used in pair-wise operator to enhance the diversity of the swarm. A pair of particles will be placed in different groups and will be applied with different evolutionary strategies. Also, to verify the performance of the proposed algorithm, a set of well-known nonlinear benchmark functions are used in the experiment. Furthermore, several evolutionary algorithms are also evaluated on the same functions as the control group. Finally, the experiment results and statistical analysis confirm the performance of PBBPSO with nonlinear functions.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - Jia Guo
AU  - Yuji Sato
PY  - 2017
DA  - 2017/07/03
TI  - A Pair-wise Bare Bones Particle Swarm Optimization Algorithm for Nonlinear Functions
JO  - International Journal of Networked and Distributed Computing
SP  - 143
EP  - 151
VL  - 5
IS  - 3
SN  - 2211-7946
UR  - https://doi.org/10.2991/ijndc.2017.5.3.3
DO  - 10.2991/ijndc.2017.5.3.3
ID  - Guo2017
ER  -