An orthogonal multi-swarm cooperative PSO algorithm with a particle trajectory knowledge base

8Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

A novel orthogonal multi-swarm cooperative particle swarm optimization (PSO) algorithm with a particle trajectory knowledge base is presented in this paper. Different from the traditional PSO algorithms and other variants of PSO, the proposed orthogonal multi-swarm cooperative PSO algorithm not only introduces an orthogonal initialization mechanism and a particle trajectory knowledge base for multi-dimensional optimization problems, but also conceives a new adaptive cooperation mechanism to accomplish the information interaction among swarms and particles. Experiments are conducted on a set of benchmark functions, and the results show its better performance compared with traditional PSO algorithm in aspects of convergence, computational efficiency and avoiding premature convergence.

Cite

CITATION STYLE

APA

Yang, J., Zhu, H., & Wang, Y. (2017). An orthogonal multi-swarm cooperative PSO algorithm with a particle trajectory knowledge base. Symmetry, 9(1). https://doi.org/10.3390/sym9010015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free