Grey-based particle swarm optimization algorithm

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

Abstract

In order to apply grey relational analysis to the evolutionary process, a modified grey relational analysis is introduced in this study. Then, with the help of such a grey relational analysis, this study also proposed a grey-based particle swarm optimization algorithm in which both inertia weight and acceleration coefficients are varying over the generations. In each generation, every particle has its own algorithm parameters and those parameters may differ for different particles. The proposed PSO algorithm is applied to solve the optimization problems of twelve test functions for illustration. Simulation results are compared with the other three variants of PSO to demonstrate the search performance of the proposed algorithm. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Yeh, M. F., Wen, C., & Leu, M. S. (2012). Grey-based particle swarm optimization algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7331 LNCS, pp. 53–62). https://doi.org/10.1007/978-3-642-30976-2_7

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