A particle swarm optimization with differential evolution

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

Abstract

Particle swarm optimization(PSO) is a simple population-based algorithm which has many advantages such as simple operation and converge quickly. However, PSO is easily trapped into local optimum. Differential evolution(DE) is a simple evolutionary algorithm the same as PSO. This paper proposes an improved PSO algorithm based on DE operator(termed IPSODE). Finally, several benchmark functions are used to evaluate the performance of the proposed IPSODE algorithm. The simulation results show the stability and the effectiveness of IPSODE algorithm on the optimum search, also demonstrate that the performance of the IPSODE is better than the standard algorithm in solving the benchmark functions. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Chen, Y., Feng, Y., Tan, Z., & Shi, X. (2011). A particle swarm optimization with differential evolution. In Communications in Computer and Information Science (Vol. 158 CCIS, pp. 384–389). https://doi.org/10.1007/978-3-642-22694-6_54

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