Gender-hierarchy particle swarm optimizer based on punishment

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper presents a novel particle swarm optimizer (PSO), called gender-hierarchy particle swarm optimizer based on punishment (GH-PSO). In the proposed algorithm, the social part and recognition part of PSO both are modified in order to accelerate the convergence and improve the accuracy of the optimal solution. Especially, a novel recognition approach, called general recognition, is presented to furthermore improve the performance of PSO. Experimental results show that the proposed algorithm shows better behaviors as compared to the standard PSO, tribes-based PSO and GH-PSO with tribes. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Gao, J., Li, H., & Hu, L. (2010). Gender-hierarchy particle swarm optimizer based on punishment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6145 LNCS, pp. 94–101). https://doi.org/10.1007/978-3-642-13495-1_12

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