Hybrid particle swarm - Evolutionary algorithm for search and optimization

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

Abstract

Particle Swarm Optimization (PSO) technique has proved its ability to deal with very complicated optimization and search problems. Several variants of the original algorithm have been proposed. This paper proposes a novel hybrid PSO - evolutionary algorithm for solving the well known geometrical place problems. Finding the geometrical place could be sometimes a hard task. In almost all situations the geometrical place consists more than one single point. The performance of the newly proposed PSO algorithm is compared with evolutionary algorithms. The main advantage of the PSO technique is its speed of convergence. Also, we propose a hybrid algorithm, combining PSO and evolutionary algorithms. The hybrid combination is able to detect the geometrical place very fast for which the evolutionary algorithms required more time and the conventional PSO approach even failed to find the real geometrical place. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Grosan, C., Abraham, A., Han, S., & Gelbukh, A. (2005). Hybrid particle swarm - Evolutionary algorithm for search and optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3789 LNAI, pp. 623–632). https://doi.org/10.1007/11579427_63

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